Base | Representation |
---|---|
bin | 11011010101010010010010… |
… | …010110101100001011101010 |
3 | 120202121222000121000112122112 |
4 | 123111102102112230023222 |
5 | 111224010040011231442 |
6 | 1103355413415522322 |
7 | 34214612602456640 |
oct | 3325222226541352 |
9 | 522558017015575 |
10 | 120210000102122 |
11 | 3533685820a117 |
12 | 115956059893a2 |
13 | 520c9a6470928 |
14 | 21982a32dd190 |
15 | dd6e109a8082 |
hex | 6d54925ac2ea |
120210000102122 has 96 divisors (see below), whose sum is σ = 221314821611520. Its totient is φ = 47837563899840.
The previous prime is 120210000102121. The next prime is 120210000102167. The reversal of 120210000102122 is 221201000012021.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 120210000102097 and 120210000102106.
It is not an unprimeable number, because it can be changed into a prime (120210000102121) 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 47 ways as a sum of consecutive naturals, for example, 740388083 + ... + 740550425.
It is an arithmetic number, because the mean of its divisors is an integer number (2305362725120).
Almost surely, 2120210000102122 is an apocalyptic number.
120210000102122 is a deficient number, since it is larger than the sum of its proper divisors (101104821509398).
120210000102122 is a wasteful number, since it uses less digits than its factorization.
120210000102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163468 (or 163415 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120210000102122 its reverse (221201000012021), we get a palindrome (341411000114143).
The spelling of 120210000102122 in words is "one hundred twenty trillion, two hundred ten billion, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •