Base | Representation |
---|---|
bin | 1010111011001001010010… |
… | …1000000110100000110101 |
3 | 1120112021001201102211222120 |
4 | 2232302110220012200311 |
5 | 3033242440324200041 |
6 | 41313513530350153 |
7 | 2346532165206204 |
oct | 256622450064065 |
9 | 46467051384876 |
10 | 12011222100021 |
11 | 3910a2681a731 |
12 | 141ba31b8b359 |
13 | 69186563b761 |
14 | 2d74bc18523b |
15 | 15c68d232366 |
hex | aec94a06835 |
12011222100021 has 8 divisors (see below), whose sum is σ = 16711265530560. Its totient is φ = 7659330034752.
The previous prime is 12011222100013. The next prime is 12011222100049. The reversal of 12011222100021 is 12000122211021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12011222100021 - 23 = 12011222100013 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011222100011) 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 7 ways as a sum of consecutive naturals, for example, 87037841236 + ... + 87037841373.
It is an arithmetic number, because the mean of its divisors is an integer number (2088908191320).
Almost surely, 212011222100021 is an apocalyptic number.
It is an amenable number.
12011222100021 is a deficient number, since it is larger than the sum of its proper divisors (4700043430539).
12011222100021 is a wasteful number, since it uses less digits than its factorization.
12011222100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174075682635.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12011222100021 its reverse (12000122211021), we get a palindrome (24011344311042).
The spelling of 12011222100021 in words is "twelve trillion, eleven billion, two hundred twenty-two million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •