Base | Representation |
---|---|
bin | 10110110010010000000001… |
… | …011111100100001100101011 |
3 | 111010211000001021110121212011 |
4 | 112302100001133210030223 |
5 | 101113320443203032334 |
6 | 553043533053100351 |
7 | 30051643136525041 |
oct | 2662200137441453 |
9 | 433730037417764 |
10 | 100210202002219 |
11 | 29a259a9612671 |
12 | b2a54a9a876b7 |
13 | 43bba20c5b00a |
14 | 1aa62b1bda391 |
15 | b8ba6d704564 |
hex | 5b24017e432b |
100210202002219 has 8 divisors (see below), whose sum is σ = 100909153769888. Its totient is φ = 99511714814400.
The previous prime is 100210202002193. The next prime is 100210202002241. The reversal of 100210202002219 is 912200202012001.
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 100210202002219 - 225 = 100210168447787 is a prime.
It is a super-2 number, since 2×1002102020022192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100210202002219.
It is not an unprimeable number, because it can be changed into a prime (100210202002279) 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, 115712052 + ... + 116574865.
It is an arithmetic number, because the mean of its divisors is an integer number (12613644221236).
Almost surely, 2100210202002219 is an apocalyptic number.
100210202002219 is a deficient number, since it is larger than the sum of its proper divisors (698951767669).
100210202002219 is a wasteful number, since it uses less digits than its factorization.
100210202002219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232289925.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 100210202002219 in words is "one hundred trillion, two hundred ten billion, two hundred two million, two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •