Base | Representation |
---|---|
bin | 111000110111110100… |
… | …0100111100110011111 |
3 | 102200020120220121010002 |
4 | 1301233220213212133 |
5 | 4000111243100411 |
6 | 132035012404515 |
7 | 11552354620160 |
oct | 1615750474637 |
9 | 380216817102 |
10 | 122132003231 |
11 | 47883371767 |
12 | 1b80591673b |
13 | b694acbc44 |
14 | 5ca8563767 |
15 | 329c24033b |
hex | 1c6fa2799f |
122132003231 has 8 divisors (see below), whose sum is σ = 145648103424. Its totient is φ = 100133070840.
The previous prime is 122132003219. The next prime is 122132003239. The reversal of 122132003231 is 132300231221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122132003231 - 26 = 122132003167 is a prime.
It is a super-2 number, since 2×1221320032312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122132003239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379291775 + ... + 379292096.
It is an arithmetic number, because the mean of its divisors is an integer number (18206012928).
Almost surely, 2122132003231 is an apocalyptic number.
122132003231 is a deficient number, since it is larger than the sum of its proper divisors (23516100193).
122132003231 is an equidigital number, since it uses as much as digits as its factorization.
122132003231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758583901.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122132003231 its reverse (132300231221), we get a palindrome (254432234452).
The spelling of 122132003231 in words is "one hundred twenty-two billion, one hundred thirty-two million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •