Base | Representation |
---|---|
bin | 1001001101110001000110… |
… | …0010110110110000100001 |
3 | 1022212121210000110111002201 |
4 | 2103130101202312300201 |
5 | 2312001041240413441 |
6 | 33314344354213201 |
7 | 2064010301463034 |
oct | 223342142666041 |
9 | 38777700414081 |
10 | 10132122201121 |
11 | 3257010925278 |
12 | 117780b284201 |
13 | 5865bb8c215b |
14 | 27057c3c301b |
15 | 12885e256c31 |
hex | 937118b6c21 |
10132122201121 has 8 divisors (see below), whose sum is σ = 10162849803488. Its totient is φ = 10101395304000.
The previous prime is 10132122201107. The next prime is 10132122201139. The reversal of 10132122201121 is 12110222123101.
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 10132122201121 - 237 = 9994683247649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132122271121) 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, 51448681 + ... + 51645241.
It is an arithmetic number, because the mean of its divisors is an integer number (1270356225436).
Almost surely, 210132122201121 is an apocalyptic number.
It is an amenable number.
10132122201121 is a deficient number, since it is larger than the sum of its proper divisors (30727602367).
10132122201121 is a wasteful number, since it uses less digits than its factorization.
10132122201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352623.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10132122201121 its reverse (12110222123101), we get a palindrome (22242344324222).
The spelling of 10132122201121 in words is "ten trillion, one hundred thirty-two billion, one hundred twenty-two million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •