Base | Representation |
---|---|
bin | 1011000110101110111010… |
… | …1101101001110001100111 |
3 | 1121020021220221101121211222 |
4 | 2301223232231221301213 |
5 | 3100023144303001411 |
6 | 41545200231450555 |
7 | 2400110444351426 |
oct | 261535655516147 |
9 | 47207827347758 |
10 | 12210302000231 |
11 | 39883a6180285 |
12 | 1452531526a5b |
13 | 6a757114758a |
14 | 302da5d972bd |
15 | 162940a094db |
hex | b1aeeb69c67 |
12210302000231 has 8 divisors (see below), whose sum is σ = 12282207381360. Its totient is φ = 12138555527488.
The previous prime is 12210302000209. The next prime is 12210302000257. The reversal of 12210302000231 is 13200020301221.
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 12210302000231 - 218 = 12210301738087 is a prime.
It is a super-2 number, since 2×122103020002312 (a number of 27 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 (12210302000131) 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, 39572966 + ... + 39880323.
It is an arithmetic number, because the mean of its divisors is an integer number (1535275922670).
Almost surely, 212210302000231 is an apocalyptic number.
12210302000231 is a deficient number, since it is larger than the sum of its proper divisors (71905381129).
12210302000231 is an equidigital number, since it uses as much as digits as its factorization.
12210302000231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79454193.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12210302000231 its reverse (13200020301221), we get a palindrome (25410322301452).
The spelling of 12210302000231 in words is "twelve trillion, two hundred ten billion, three hundred two million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •