Base | Representation |
---|---|
bin | 1011000110001000111101… |
… | …0010110111111000010001 |
3 | 1121012022121201121211201210 |
4 | 2301202033102313320101 |
5 | 3044341311432210001 |
6 | 41540353111450333 |
7 | 2366300062150641 |
oct | 261421722677021 |
9 | 47168551554653 |
10 | 12200111210001 |
11 | 39840467a37a0 |
12 | 14505686869a9 |
13 | 6a6608a78aa0 |
14 | 3026ba76c521 |
15 | 162546010dd6 |
hex | b188f4b7e11 |
12200111210001 has 16 divisors (see below), whose sum is σ = 19110663714240. Its totient is φ = 6825237040320.
The previous prime is 12200111209969. The next prime is 12200111210003. The reversal of 12200111210001 is 10001211100221.
12200111210001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12200111210001 - 25 = 12200111209969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12200111210003) 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, 14219243406 + ... + 14219244263.
It is an arithmetic number, because the mean of its divisors is an integer number (1194416482140).
Almost surely, 212200111210001 is an apocalyptic number.
12200111210001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12200111210001 is a deficient number, since it is larger than the sum of its proper divisors (6910552504239).
12200111210001 is a wasteful number, since it uses less digits than its factorization.
12200111210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28438487696.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12200111210001 its reverse (10001211100221), we get a palindrome (22201322310222).
The spelling of 12200111210001 in words is "twelve trillion, two hundred billion, one hundred eleven million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •