Base | Representation |
---|---|
bin | 1011000110001000100010… |
… | …1110100010000001110101 |
3 | 1121012022100001021121111102 |
4 | 2301202020232202001311 |
5 | 3044341100230120041 |
6 | 41540334134015445 |
7 | 2366264253435233 |
oct | 261421056420165 |
9 | 47168301247442 |
10 | 12200001020021 |
11 | 3983a9a5823a1 |
12 | 14505377a7585 |
13 | 6a65bbca8109 |
14 | 3026a9c87953 |
15 | 16253b4e709b |
hex | b1888ba2075 |
12200001020021 has 8 divisors (see below), whose sum is σ = 12382419331104. Its totient is φ = 12017592378000.
The previous prime is 12200001019963. The next prime is 12200001020041. The reversal of 12200001020021 is 12002010000221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12200001020021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200001019984 and 12200001020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200001020041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145271 + ... + 4941771.
It is an arithmetic number, because the mean of its divisors is an integer number (1547802416388).
Almost surely, 212200001020021 is an apocalyptic number.
It is an amenable number.
12200001020021 is a deficient number, since it is larger than the sum of its proper divisors (182418311083).
12200001020021 is an equidigital number, since it uses as much as digits as its factorization.
12200001020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4834531.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12200001020021 its reverse (12002010000221), we get a palindrome (24202011020242).
The spelling of 12200001020021 in words is "twelve trillion, two hundred billion, one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •