Base | Representation |
---|---|
bin | 10110111111001100111001… |
… | …100001010101110100111011 |
3 | 111020222002021210010121222111 |
4 | 112333030321201111310323 |
5 | 101222411202224101021 |
6 | 555004442451433151 |
7 | 30203151131550364 |
oct | 2677147141256473 |
9 | 436862253117874 |
10 | 101100200222011 |
11 | 2a239399391a01 |
12 | b409a905b57b7 |
13 | 4454928555583 |
14 | 1ad73c0b18b6b |
15 | ba4cacb208e1 |
hex | 5bf339855d3b |
101100200222011 has 8 divisors (see below), whose sum is σ = 105545922411600. Its totient is φ = 96718445258400.
The previous prime is 101100200221949. The next prime is 101100200222029. The reversal of 101100200222011 is 110222002001101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101100200222011 - 237 = 100962761268539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100200221982 and 101100200222000.
It is not an unprimeable number, because it can be changed into a prime (101100200222311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15991803265 + ... + 15991809586.
It is an arithmetic number, because the mean of its divisors is an integer number (13193240301450).
Almost surely, 2101100200222011 is an apocalyptic number.
101100200222011 is a deficient number, since it is larger than the sum of its proper divisors (4445722189589).
101100200222011 is a wasteful number, since it uses less digits than its factorization.
101100200222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31983612989.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101100200222011 its reverse (110222002001101), we get a palindrome (211322202223112).
The spelling of 101100200222011 in words is "one hundred one trillion, one hundred billion, two hundred million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.336 sec. • engine limits •