Base | Representation |
---|---|
bin | 111000110111001010… |
… | …0101011101110000001 |
3 | 102200012001111201100122 |
4 | 1301232110223232001 |
5 | 4000040130000001 |
6 | 132032505030025 |
7 | 11551666605623 |
oct | 1615624535601 |
9 | 380161451318 |
10 | 122110000001 |
11 | 47871a03380 |
12 | 1b7ba485315 |
13 | b690396a92 |
14 | 5ca5676c13 |
15 | 329a345b1b |
hex | 1c6e52bb81 |
122110000001 has 32 divisors (see below), whose sum is σ = 136079032320. Its totient is φ = 108650808000.
The previous prime is 122109999983. The next prime is 122110000013. The reversal of 122110000001 is 100000011221.
It is a cyclic number.
It is not a de Polignac number, because 122110000001 - 210 = 122109998977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122110000021) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 43315370 + ... + 43318188.
It is an arithmetic number, because the mean of its divisors is an integer number (4252469760).
Almost surely, 2122110000001 is an apocalyptic number.
122110000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122110000001 is a deficient number, since it is larger than the sum of its proper divisors (13969032319).
122110000001 is a wasteful number, since it uses less digits than its factorization.
122110000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3365.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 122110000001 its reverse (100000011221), we get a palindrome (222110011222).
It can be divided in two parts, 1221 and 10000001, that multiplied together give a palindrome (12210001221).
The spelling of 122110000001 in words is "one hundred twenty-two billion, one hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •