Base | Representation |
---|---|
bin | 1011000000011000111001… |
… | …0111001010100110010111 |
3 | 1120211212121012011220111202 |
4 | 2300012032113022212113 |
5 | 3041231441143411411 |
6 | 41423133215023115 |
7 | 2356201526645633 |
oct | 260061627124627 |
9 | 46755535156452 |
10 | 12101311310231 |
11 | 3946156832770 |
12 | 143539480aa9b |
13 | 69a1c1a97330 |
14 | 2db9c6c65dc3 |
15 | 15ebb233183b |
hex | b018e5ca997 |
12101311310231 has 32 divisors (see below), whose sum is σ = 14261941940736. Its totient is φ = 10122800688000.
The previous prime is 12101311310183. The next prime is 12101311310251. The reversal of 12101311310231 is 13201311310121.
It is not a de Polignac number, because 12101311310231 - 210 = 12101311309207 is a prime.
It is a super-2 number, since 2×121013113102312 (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 (12101311310251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 434550350 + ... + 434578196.
It is an arithmetic number, because the mean of its divisors is an integer number (445685685648).
Almost surely, 212101311310231 is an apocalyptic number.
12101311310231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12101311310231 is a deficient number, since it is larger than the sum of its proper divisors (2160630630505).
12101311310231 is a wasteful number, since it uses less digits than its factorization.
12101311310231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37383.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 12101311310231 its reverse (13201311310121), we get a palindrome (25302622620352).
The spelling of 12101311310231 in words is "twelve trillion, one hundred one billion, three hundred eleven million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •