Base | Representation |
---|---|
bin | 1001001100000001010101… |
… | …1001001101100110001110 |
3 | 1022202202100020210220221220 |
4 | 2103000111121031212032 |
5 | 2311003121213323042 |
6 | 33252503434104210 |
7 | 2061566000202666 |
oct | 223002531154616 |
9 | 38682306726856 |
10 | 10102122011022 |
11 | 3245316571438 |
12 | 1171a3827b066 |
13 | 58381a491692 |
14 | 26cd33d291a6 |
15 | 127ba55e18ec |
hex | 9301564d98e |
10102122011022 has 8 divisors (see below), whose sum is σ = 20204244022056. Its totient is φ = 3367374003672.
The previous prime is 10102122010999. The next prime is 10102122011039. The reversal of 10102122011022 is 22011022120101.
It is a sphenic number, since it is the product of 3 distinct primes.
10102122011022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10102122010992 and 10102122011010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 841843500913 + ... + 841843500924.
It is an arithmetic number, because the mean of its divisors is an integer number (2525530502757).
Almost surely, 210102122011022 is an apocalyptic number.
10102122011022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102122011022 is a wasteful number, since it uses less digits than its factorization.
10102122011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683687001842.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10102122011022 its reverse (22011022120101), we get a palindrome (32113144131123).
The spelling of 10102122011022 in words is "ten trillion, one hundred two billion, one hundred twenty-two million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •