Base | Representation |
---|---|
bin | 10110110100000000101000… |
… | …111000110000100100100101 |
3 | 111011020120011101210002002110 |
4 | 112310000220320300210211 |
5 | 101122311114213032323 |
6 | 553215251532231233 |
7 | 30063453506545134 |
oct | 2664005070604445 |
9 | 434216141702073 |
10 | 100331122002213 |
11 | 29a7220a81a363 |
12 | b304a1590b519 |
13 | 43ca25192217b |
14 | 1aac0a33c791b |
15 | b8ec99337793 |
hex | 5b4028e30925 |
100331122002213 has 16 divisors (see below), whose sum is σ = 138090516480000. Its totient is φ = 64729582661040.
The previous prime is 100331122002193. The next prime is 100331122002257. The reversal of 100331122002213 is 312200221133001.
It is not a de Polignac number, because 100331122002213 - 212 = 100331121998117 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100331122002213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100331122002283) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39709288 + ... + 42160286.
It is an arithmetic number, because the mean of its divisors is an integer number (8630657280000).
Almost surely, 2100331122002213 is an apocalyptic number.
It is an amenable number.
100331122002213 is a deficient number, since it is larger than the sum of its proper divisors (37759394477787).
100331122002213 is a wasteful number, since it uses less digits than its factorization.
100331122002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2891192.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 100331122002213 its reverse (312200221133001), we get a palindrome (412531343135214).
The spelling of 100331122002213 in words is "one hundred trillion, three hundred thirty-one billion, one hundred twenty-two million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •