Base | Representation |
---|---|
bin | 110000001110111001101011… |
… | …000101000010001000101111 |
3 | 1000211002110012112202011022122 |
4 | 300032321223011002020233 |
5 | 210301020203143343043 |
6 | 2031055141034503155 |
7 | 62452621611455360 |
oct | 6016715305021057 |
9 | 1024073175664278 |
10 | 212130231231023 |
11 | 61655a203405a6 |
12 | 1b960315294abb |
13 | 9149a44723981 |
14 | 3a5522d69db67 |
15 | 197ceda29b368 |
hex | c0ee6b14222f |
212130231231023 has 8 divisors (see below), whose sum is σ = 242435605346592. Its totient is φ = 181825120957536.
The previous prime is 212130231231013. The next prime is 212130231231049. The reversal of 212130231231023 is 320132132031212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212130231231023 - 28 = 212130231230767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212130231230983 and 212130231231001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212130231231013) 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, 64234640 + ... + 67456277.
It is an arithmetic number, because the mean of its divisors is an integer number (30304450668324).
Almost surely, 2212130231231023 is an apocalyptic number.
212130231231023 is a deficient number, since it is larger than the sum of its proper divisors (30305374115569).
212130231231023 is a wasteful number, since it uses less digits than its factorization.
212130231231023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131921041.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 212130231231023 its reverse (320132132031212), we get a palindrome (532262363262235).
The spelling of 212130231231023 in words is "two hundred twelve trillion, one hundred thirty billion, two hundred thirty-one million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •