Base | Representation |
---|---|
bin | 111000111000011010… |
… | …0111011000000000001 |
3 | 102200021222112211020210 |
4 | 1301300310323000001 |
5 | 4000131403140013 |
6 | 132041005224333 |
7 | 11553016626210 |
oct | 1616064730001 |
9 | 380258484223 |
10 | 122152005633 |
11 | 47893693879 |
12 | 1b8105620a9 |
13 | b698cb3498 |
14 | 5cab08d077 |
15 | 329dd91cc3 |
hex | 1c70d3b001 |
122152005633 has 8 divisors (see below), whose sum is σ = 186136389568. Its totient is φ = 69801146064.
The previous prime is 122152005629. The next prime is 122152005659. The reversal of 122152005633 is 336500251221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122152005633 - 22 = 122152005629 is a prime.
It is a super-2 number, since 2×1221520056332 (a number of 23 digits) contains 22 as substring.
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 122152005633.
It is not an unprimeable number, because it can be changed into a prime (122152015633) 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, 2908381066 + ... + 2908381107.
It is an arithmetic number, because the mean of its divisors is an integer number (23267048696).
Almost surely, 2122152005633 is an apocalyptic number.
It is an amenable number.
122152005633 is a deficient number, since it is larger than the sum of its proper divisors (63984383935).
122152005633 is an equidigital number, since it uses as much as digits as its factorization.
122152005633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5816762183.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 122152005633 its reverse (336500251221), we get a palindrome (458652256854).
The spelling of 122152005633 in words is "one hundred twenty-two billion, one hundred fifty-two million, five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •