Base | Representation |
---|---|
bin | 1010111010100011111111… |
… | …0111110100000111010011 |
3 | 1120111022012222022200220212 |
4 | 2232220333313310013103 |
5 | 3033111434304033021 |
6 | 41305140241154335 |
7 | 2346026114510444 |
oct | 256507767640723 |
9 | 46438188280825 |
10 | 12001210221011 |
11 | 3907759331860 |
12 | 1419ab902b9ab |
13 | 69092b3523ab |
14 | 2d6c0c60d2cb |
15 | 15c2a42c985b |
hex | aea3fdf41d3 |
12001210221011 has 24 divisors (see below), whose sum is σ = 13757474808000. Its totient is φ = 10379295541200.
The previous prime is 12001210221001. The next prime is 12001210221019. The reversal of 12001210221011 is 11012201210021.
It is not a de Polignac number, because 12001210221011 - 222 = 12001206026707 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12001210221019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8997461 + ... + 10244838.
It is an arithmetic number, because the mean of its divisors is an integer number (573228117000).
Almost surely, 212001210221011 is an apocalyptic number.
12001210221011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12001210221011 is a deficient number, since it is larger than the sum of its proper divisors (1756264586989).
12001210221011 is a wasteful number, since it uses less digits than its factorization.
12001210221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19242431 (or 19242400 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12001210221011 its reverse (11012201210021), we get a palindrome (23013411431032).
It can be divided in two parts, 12001210 and 221011, that added together give a palindrome (12222221).
The spelling of 12001210221011 in words is "twelve trillion, one billion, two hundred ten million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •