Base | Representation |
---|---|
bin | 1011000000010111101111… |
… | …0100011010101000111001 |
3 | 1120211211210111210102121001 |
4 | 2300011323310122220321 |
5 | 3041230322023223001 |
6 | 41423042303045001 |
7 | 2356161031441042 |
oct | 260057364325071 |
9 | 46754714712531 |
10 | 12101000211001 |
11 | 3946007168269 |
12 | 14353085a0761 |
13 | 69a1724b1550 |
14 | 2db9978038c9 |
15 | 15eb94d7e001 |
hex | b017bd1aa39 |
12101000211001 has 16 divisors (see below), whose sum is σ = 13072603501440. Its totient is φ = 11135268910080.
The previous prime is 12101000210989. The next prime is 12101000211043. The reversal of 12101000211001 is 10011200010121.
12101000211001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12101000211001 - 29 = 12101000210489 is a prime.
It is a super-2 number, since 2×121010002110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101000211401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4834521 + ... + 6897433.
It is an arithmetic number, because the mean of its divisors is an integer number (817037718840).
Almost surely, 212101000211001 is an apocalyptic number.
It is an amenable number.
12101000211001 is a deficient number, since it is larger than the sum of its proper divisors (971603290439).
12101000211001 is a wasteful number, since it uses less digits than its factorization.
12101000211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2064336.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12101000211001 its reverse (10011200010121), we get a palindrome (22112200221122).
The spelling of 12101000211001 in words is "twelve trillion, one hundred one billion, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •