Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …1000110001011110110010 |
3 | 1121012102012101220111011102 |
4 | 2301203022320301132302 |
5 | 3044400333404013020 |
6 | 41541040224444402 |
7 | 2366333622221351 |
oct | 261431270613662 |
9 | 47172171814142 |
10 | 12201111001010 |
11 | 398450a094558 |
12 | 14507a7479702 |
13 | 6a6737c41ab9 |
14 | 302773463998 |
15 | 1625a3ba0475 |
hex | b18cae317b2 |
12201111001010 has 8 divisors (see below), whose sum is σ = 21961999801836. Its totient is φ = 4880444400400.
The previous prime is 12201111001003. The next prime is 12201111001021. The reversal of 12201111001010 is 1010011110221.
12201111001010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10458439070401 + 1742671930609 = 3233951^2 + 1320103^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12201111000982 and 12201111001000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 610055550041 + ... + 610055550060.
Almost surely, 212201111001010 is an apocalyptic number.
12201111001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12201111001010 is a deficient number, since it is larger than the sum of its proper divisors (9760888800826).
12201111001010 is a wasteful number, since it uses less digits than its factorization.
12201111001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1220111100108.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12201111001010 its reverse (1010011110221), we get a palindrome (13211122111231).
The spelling of 12201111001010 in words is "twelve trillion, two hundred one billion, one hundred eleven million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •