Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …110100000110111111101 |
3 | 10220020212202002112222100 |
4 | 100001120312200313331 |
5 | 121014323043010323 |
6 | 2201443220335313 |
7 | 142354602151335 |
oct | 20013066406775 |
9 | 3806782075870 |
10 | 1101002313213 |
11 | 394a29114820 |
12 | 15946b544539 |
13 | 7ca9364530a |
14 | 3b4086580c5 |
15 | 1d98d98c943 |
hex | 10058da0dfd |
1101002313213 has 48 divisors (see below), whose sum is σ = 1756130725440. Its totient is φ = 659116262400.
The previous prime is 1101002313209. The next prime is 1101002313277. The reversal of 1101002313213 is 3123132001011.
1101002313213 is a `hidden beast` number, since 1 + 10 + 100 + 231 + 321 + 3 = 666.
It is not a de Polignac number, because 1101002313213 - 22 = 1101002313209 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101002313913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71817133 + ... + 71832461.
It is an arithmetic number, because the mean of its divisors is an integer number (36586056780).
Almost surely, 21101002313213 is an apocalyptic number.
It is an amenable number.
1101002313213 is a deficient number, since it is larger than the sum of its proper divisors (655128412227).
1101002313213 is a wasteful number, since it uses less digits than its factorization.
1101002313213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24170 (or 24167 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1101002313213 its reverse (3123132001011), we get a palindrome (4224134314224).
The spelling of 1101002313213 in words is "one trillion, one hundred one billion, two million, three hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •