Base | Representation |
---|---|
bin | 111000111100110111… |
… | …0100001001100101111 |
3 | 102200200101111212211202 |
4 | 1301321232201030233 |
5 | 4000433114301111 |
6 | 132103501440115 |
7 | 11556512041040 |
oct | 1617156411457 |
9 | 380611455752 |
10 | 122301322031 |
11 | 4795a9a9459 |
12 | 1b85257003b |
13 | b6c0c03195 |
14 | 5cc2c3a8c7 |
15 | 32ac038b3b |
hex | 1c79ba132f |
122301322031 has 8 divisors (see below), whose sum is σ = 139775125920. Its totient is φ = 104828064768.
The previous prime is 122301321991. The next prime is 122301322037. The reversal of 122301322031 is 130223103221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-122301322031 is a prime.
It is a super-2 number, since 2×1223013220312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122301321994 and 122301322012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122301322037) 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, 628175 + ... + 799503.
It is an arithmetic number, because the mean of its divisors is an integer number (17471890740).
Almost surely, 2122301322031 is an apocalyptic number.
122301322031 is a deficient number, since it is larger than the sum of its proper divisors (17473803889).
122301322031 is a wasteful number, since it uses less digits than its factorization.
122301322031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273313.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122301322031 its reverse (130223103221), we get a palindrome (252524425252).
The spelling of 122301322031 in words is "one hundred twenty-two billion, three hundred one million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •