Base | Representation |
---|---|
bin | 1011000110001000100111… |
… | …1011001011000110100001 |
3 | 1121012022101110002100102012 |
4 | 2301202021323023012201 |
5 | 3044341120401024301 |
6 | 41540340132402305 |
7 | 2366264616264140 |
oct | 261421173130641 |
9 | 47168343070365 |
10 | 12200021111201 |
11 | 3983aaa955180 |
12 | 1450542476395 |
13 | 6a65c31c0ba1 |
14 | 3026ac7d7757 |
15 | 16253d164ebb |
hex | b1889ecb1a1 |
12200021111201 has 16 divisors (see below), whose sum is σ = 15871738364928. Its totient is φ = 9093183435600.
The previous prime is 12200021111189. The next prime is 12200021111207. The reversal of 12200021111201 is 10211112000221.
It is a de Polignac number, because none of the positive numbers 2k-12200021111201 is a prime.
It is a super-2 number, since 2×122000211112012 (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 (12200021111207) 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, 3444385895 + ... + 3444389436.
It is an arithmetic number, because the mean of its divisors is an integer number (991983647808).
Almost surely, 212200021111201 is an apocalyptic number.
12200021111201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12200021111201 is a deficient number, since it is larger than the sum of its proper divisors (3671717253727).
12200021111201 is a wasteful number, since it uses less digits than its factorization.
12200021111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6888775372.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12200021111201 its reverse (10211112000221), we get a palindrome (22411133111422).
The spelling of 12200021111201 in words is "twelve trillion, two hundred billion, twenty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •