Base | Representation |
---|---|
bin | 111000110100000110… |
… | …0010000000110010001 |
3 | 102122220212221012022220 |
4 | 1301220030100012101 |
5 | 3444332311021132 |
6 | 132014352051253 |
7 | 11546310314631 |
oct | 1615014200621 |
9 | 378825835286 |
10 | 122007126417 |
11 | 47819929990 |
12 | 1b78bb33b29 |
13 | b674c88337 |
14 | 5c95b386c1 |
15 | 32912c4a2c |
hex | 1c68310191 |
122007126417 has 16 divisors (see below), whose sum is σ = 177578818560. Its totient is φ = 73896251600.
The previous prime is 122007126391. The next prime is 122007126443. The reversal of 122007126417 is 714621700221.
It is an interprime number because it is at equal distance from previous prime (122007126391) and next prime (122007126443).
It is a cyclic number.
It is not a de Polignac number, because 122007126417 - 214 = 122007110033 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (122007126217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1134309 + ... + 1237202.
It is an arithmetic number, because the mean of its divisors is an integer number (11098676160).
Almost surely, 2122007126417 is an apocalyptic number.
It is an amenable number.
122007126417 is a deficient number, since it is larger than the sum of its proper divisors (55571692143).
122007126417 is a wasteful number, since it uses less digits than its factorization.
122007126417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2373084.
The product of its (nonzero) digits is 9408, while the sum is 33.
Adding to 122007126417 its reverse (714621700221), we get a palindrome (836628826638).
The spelling of 122007126417 in words is "one hundred twenty-two billion, seven million, one hundred twenty-six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •