Base | Representation |
---|---|
bin | 111000110111110000… |
… | …1011100011001001001 |
3 | 102200020110101000222110 |
4 | 1301233201130121021 |
5 | 4000110302403223 |
6 | 132034504212533 |
7 | 11552332624353 |
oct | 1615741343111 |
9 | 380213330873 |
10 | 122130122313 |
11 | 478822a7591 |
12 | 1b80516a149 |
13 | b6945c0a84 |
14 | 5ca81d40d3 |
15 | 329bebcd93 |
hex | 1c6f85c649 |
122130122313 has 8 divisors (see below), whose sum is σ = 163515849376. Its totient is φ = 81082238400.
The previous prime is 122130122299. The next prime is 122130122321. The reversal of 122130122313 is 313221031221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122130122313 - 28 = 122130122057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122130122313.
It is not an unprimeable number, because it can be changed into a prime (122130102313) 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 7 ways as a sum of consecutive naturals, for example, 84459943 + ... + 84461388.
It is an arithmetic number, because the mean of its divisors is an integer number (20439481172).
Almost surely, 2122130122313 is an apocalyptic number.
It is an amenable number.
122130122313 is a deficient number, since it is larger than the sum of its proper divisors (41385727063).
122130122313 is a wasteful number, since it uses less digits than its factorization.
122130122313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168921575.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122130122313 its reverse (313221031221), we get a palindrome (435351153534).
The spelling of 122130122313 in words is "one hundred twenty-two billion, one hundred thirty million, one hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •