Base | Representation |
---|---|
bin | 11011110000110011100001… |
… | …111100011010001001001100 |
3 | 121000022202100001121221002012 |
4 | 123300303201330122021030 |
5 | 112001001043434000022 |
6 | 1111404251451520352 |
7 | 34501341414046310 |
oct | 3360634174321114 |
9 | 530282301557065 |
10 | 122101121000012 |
11 | 359a58816a8a90 |
12 | 118400224590b8 |
13 | 53191177c4a9b |
14 | 2221a237c7b40 |
15 | e1b1e4ea0de2 |
hex | 6f0ce1f1a24c |
122101121000012 has 24 divisors (see below), whose sum is σ = 266402445818880. Its totient is φ = 47571865324560.
The previous prime is 122101121000009. The next prime is 122101121000071. The reversal of 122101121000012 is 210000121101221.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 198216105212 + ... + 198216105827.
It is an arithmetic number, because the mean of its divisors is an integer number (11100101909120).
Almost surely, 2122101121000012 is an apocalyptic number.
It is an amenable number.
122101121000012 is an abundant number, since it is smaller than the sum of its proper divisors (144301324818868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122101121000012 is a wasteful number, since it uses less digits than its factorization.
122101121000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396432211061 (or 396432211059 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122101121000012 its reverse (210000121101221), we get a palindrome (332101242101233).
The spelling of 122101121000012 in words is "one hundred twenty-two trillion, one hundred one billion, one hundred twenty-one million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •