Base | Representation |
---|---|
bin | 1001001100000001010011… |
… | …0011011111010100001010 |
3 | 1022202202022120012111221100 |
4 | 2103000110303133110022 |
5 | 2311003111200401442 |
6 | 33252502442122230 |
7 | 2061565520145246 |
oct | 223002463372412 |
9 | 38682276174840 |
10 | 10102112122122 |
11 | 3245310a27799 |
12 | 1171a34ab0376 |
13 | 58381840b567 |
14 | 26cd328b3426 |
15 | 127ba47db84c |
hex | 93014cdf50a |
10102112122122 has 48 divisors (see below), whose sum is σ = 22259529077760. Its totient is φ = 3310201752000.
The previous prime is 10102112122111. The next prime is 10102112122159. The reversal of 10102112122122 is 22122121120101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10102112122095 and 10102112122104.
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 23 ways as a sum of consecutive naturals, for example, 43512247 + ... + 43743797.
It is an arithmetic number, because the mean of its divisors is an integer number (463740189120).
Almost surely, 210102112122122 is an apocalyptic number.
10102112122122 is an abundant number, since it is smaller than the sum of its proper divisors (12157416955638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102112122122 is a wasteful number, since it uses less digits than its factorization.
10102112122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272699 (or 272696 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10102112122122 its reverse (22122121120101), we get a palindrome (32224233242223).
The spelling of 10102112122122 in words is "ten trillion, one hundred two billion, one hundred twelve million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •