Base | Representation |
---|---|
bin | 10110100010100101… |
… | …10111111000100111 |
3 | 1011020100202202120121 |
4 | 23101102313320213 |
5 | 144240414221411 |
6 | 5320445142411 |
7 | 605611345000 |
oct | 132122677047 |
9 | 34210682517 |
10 | 12101320231 |
11 | 514a975000 |
12 | 241885aa07 |
13 | 11ab14b220 |
14 | 82b2741a7 |
15 | 4ac5d6571 |
hex | 2d14b7e27 |
12101320231 has 64 divisors (see below), whose sum is σ = 16724736000. Its totient is φ = 8699977440.
The previous prime is 12101320207. The next prime is 12101320243. The reversal of 12101320231 is 13202310121.
It is not a de Polignac number, because 12101320231 - 25 = 12101320199 is a prime.
It is a super-2 number, since 2×121013202312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101320031) 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 63 ways as a sum of consecutive naturals, for example, 5933910 + ... + 5935948.
It is an arithmetic number, because the mean of its divisors is an integer number (261324000).
Almost surely, 212101320231 is an apocalyptic number.
12101320231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12101320231 is a deficient number, since it is larger than the sum of its proper divisors (4623415769).
12101320231 is an equidigital number, since it uses as much as digits as its factorization.
12101320231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106 (or 2070 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12101320231 its reverse (13202310121), we get a palindrome (25303630352).
The spelling of 12101320231 in words is "twelve billion, one hundred one million, three hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •