Base | Representation |
---|---|
bin | 10110100010100101… |
… | …10111110101010101 |
3 | 1011020100202202021211 |
4 | 23101102313311111 |
5 | 144240414220041 |
6 | 5320445141421 |
7 | 605611344250 |
oct | 132122676525 |
9 | 34210682254 |
10 | 12101320021 |
11 | 514a97492a |
12 | 241885a871 |
13 | 11ab14b0bb |
14 | 82b274097 |
15 | 4ac5d6481 |
hex | 2d14b7d55 |
12101320021 has 16 divisors (see below), whose sum is σ = 14391590400. Its totient is φ = 9959605488.
The previous prime is 12101319977. The next prime is 12101320031. The reversal of 12101320021 is 12002310121.
It is not a de Polignac number, because 12101320021 - 29 = 12101319509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12101319983 and 12101320010.
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 15 ways as a sum of consecutive naturals, for example, 322951 + ... + 358468.
It is an arithmetic number, because the mean of its divisors is an integer number (899474400).
Almost surely, 212101320021 is an apocalyptic number.
It is an amenable number.
12101320021 is a deficient number, since it is larger than the sum of its proper divisors (2290270379).
12101320021 is an equidigital number, since it uses as much as digits as its factorization.
12101320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681528.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 12101320021 its reverse (12002310121), we get a palindrome (24103630142).
It can be divided in two parts, 1210 and 1320021, that added together give a palindrome (1321231).
The spelling of 12101320021 in words is "twelve billion, one hundred one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •