Base | Representation |
---|---|
bin | 1011000010000111100111… |
… | …0111011001111001001111 |
3 | 1120221201022111022002202011 |
4 | 2300201321313121321033 |
5 | 3042223323221223043 |
6 | 41444530321042051 |
7 | 2361303200305315 |
oct | 260417167317117 |
9 | 46851274262664 |
10 | 12131032211023 |
11 | 39578184783a0 |
12 | 143b0aa186327 |
13 | 69cc4a39ba6b |
14 | 2dd2061bc0b5 |
15 | 1608516c959d |
hex | b0879dd9e4f |
12131032211023 has 8 divisors (see below), whose sum is σ = 13234291123536. Its totient is φ = 11027846265600.
The previous prime is 12131032210949. The next prime is 12131032211063. The reversal of 12131032211023 is 32011223013121.
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 12131032211023 - 225 = 12130998656591 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12131032210985 and 12131032211003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131032211063) 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, 17893858 + ... + 18559423.
It is an arithmetic number, because the mean of its divisors is an integer number (1654286390442).
Almost surely, 212131032211023 is an apocalyptic number.
12131032211023 is a deficient number, since it is larger than the sum of its proper divisors (1103258912513).
12131032211023 is a wasteful number, since it uses less digits than its factorization.
12131032211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36483545.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12131032211023 its reverse (32011223013121), we get a palindrome (44142255224144).
The spelling of 12131032211023 in words is "twelve trillion, one hundred thirty-one billion, thirty-two million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •