Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …1110101011111000001010 |
3 | 1100010022200201000101101202 |
4 | 2110131203032223320022 |
5 | 2314123112300401442 |
6 | 33410455340344202 |
7 | 2102041220126036 |
oct | 224354316537012 |
9 | 40108621011352 |
10 | 10202212122122 |
11 | 3283808854319 |
12 | 1189310245062 |
13 | 5900ab8617a7 |
14 | 273b0ad251c6 |
15 | 12a5b26cac32 |
hex | 947633abe0a |
10202212122122 has 8 divisors (see below), whose sum is σ = 15303581712900. Its totient is φ = 5101018217824.
The previous prime is 10202212122121. The next prime is 10202212122143. The reversal of 10202212122122 is 22122121220201.
10202212122122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9120526840441 + 1081685281681 = 3020021^2 + 1040041^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10202212122094 and 10202212122103.
It is not an unprimeable number, because it can be changed into a prime (10202212122121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43776347 + ... + 44008782.
Almost surely, 210202212122122 is an apocalyptic number.
10202212122122 is a deficient number, since it is larger than the sum of its proper divisors (5101369590778).
10202212122122 is an equidigital number, since it uses as much as digits as its factorization.
10202212122122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87843240.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 10202212122122 its reverse (22122121220201), we get a palindrome (32324333342323).
The spelling of 10202212122122 in words is "ten trillion, two hundred two billion, two hundred twelve million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •