Base | Representation |
---|---|
bin | 11011110100001001110110… |
… | …101101101000111101010001 |
3 | 121001010202100011022120120022 |
4 | 123310021312231220331101 |
5 | 112013233400022403101 |
6 | 1112102111151153225 |
7 | 34524066264012554 |
oct | 3364116655507521 |
9 | 531122304276508 |
10 | 122331250200401 |
11 | 35a844346293a0 |
12 | 11878748215815 |
13 | 5334a30ba4888 |
14 | 222cc1514669b |
15 | e221b3570a1b |
hex | 6f4276b68f51 |
122331250200401 has 8 divisors (see below), whose sum is σ = 133878638038944. Its totient is φ = 110854923210720.
The previous prime is 122331250200391. The next prime is 122331250200403. The reversal of 122331250200401 is 104002052133221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122331250200401 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122331250200403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17765208611 + ... + 17765215496.
It is an arithmetic number, because the mean of its divisors is an integer number (16734829754868).
Almost surely, 2122331250200401 is an apocalyptic number.
122331250200401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122331250200401 is a deficient number, since it is larger than the sum of its proper divisors (11547387838543).
122331250200401 is a wasteful number, since it uses less digits than its factorization.
122331250200401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35530424431.
The product of its (nonzero) digits is 2880, while the sum is 26.
The spelling of 122331250200401 in words is "one hundred twenty-two trillion, three hundred thirty-one billion, two hundred fifty million, two hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •