Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …010110111000010100100010 |
3 | 111010212011001021210111101201 |
4 | 112302123031112320110202 |
5 | 101114020042311241002 |
6 | 553053240525351414 |
7 | 30052546563603646 |
oct | 2662331526702442 |
9 | 433764037714351 |
10 | 100222212212002 |
11 | 29a30002007a81 |
12 | b2a78a010856a |
13 | 43bcbb6258a1a |
14 | 1aa6ad0d14c26 |
15 | b8c022ce0087 |
hex | 5b26cd5b8522 |
100222212212002 has 8 divisors (see below), whose sum is σ = 155517225846300. Its totient is φ = 48383136929904.
The previous prime is 100222212211969. The next prime is 100222212212009. The reversal of 100222212212002 is 200212212222001.
It can be written as a sum of positive squares in 2 ways, for example, as 97882747132041 + 2339465079961 = 9893571^2 + 1529531^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (100222212212009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 863984587977 + ... + 863984588092.
Almost surely, 2100222212212002 is an apocalyptic number.
100222212212002 is a deficient number, since it is larger than the sum of its proper divisors (55295013634298).
100222212212002 is a wasteful number, since it uses less digits than its factorization.
100222212212002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1727969176100.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 100222212212002 its reverse (200212212222001), we get a palindrome (300434424434003).
Subtracting 100222212212002 from its reverse (200212212222001), we obtain a palindrome (99990000009999).
The spelling of 100222212212002 in words is "one hundred trillion, two hundred twenty-two billion, two hundred twelve million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •