Base | Representation |
---|---|
bin | 10110110010010001110010… |
… | …101111110111110001101010 |
3 | 111010211011221200211200220122 |
4 | 112302101302233313301222 |
5 | 101113333341114231442 |
6 | 553044445410523242 |
7 | 30052041211231643 |
oct | 2662216257676152 |
9 | 433734850750818 |
10 | 100212102102122 |
11 | 29a2679412686a |
12 | b2a593a296522 |
13 | 43bbc647c819a |
14 | 1aa64122cc6ca |
15 | b8bb30431dd2 |
hex | 5b2472bf7c6a |
100212102102122 has 4 divisors (see below), whose sum is σ = 150318153153186. Its totient is φ = 50106051051060.
The previous prime is 100212102102121. The next prime is 100212102102137. The reversal of 100212102102122 is 221201201212001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 89616875291161 + 10595226810961 = 9466619^2 + 3255031^2 .
It is a super-2 number, since 2×1002121021021222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100212102102122.
It is not an unprimeable number, because it can be changed into a prime (100212102102121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25053025525529 + ... + 25053025525532.
Almost surely, 2100212102102122 is an apocalyptic number.
100212102102122 is a deficient number, since it is larger than the sum of its proper divisors (50106051051064).
100212102102122 is an equidigital number, since it uses as much as digits as its factorization.
100212102102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50106051051063.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 100212102102122 its reverse (221201201212001), we get a palindrome (321413303314123).
The spelling of 100212102102122 in words is "one hundred trillion, two hundred twelve billion, one hundred two million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •