Base | Representation |
---|---|
bin | 1011000010010000000100… |
… | …1110010001111101101010 |
3 | 1120221221011202102211200212 |
4 | 2300210001032101331222 |
5 | 3042243001100211020 |
6 | 41445543522501122 |
7 | 2361413363645234 |
oct | 260440116217552 |
9 | 46857152384625 |
10 | 12133303132010 |
11 | 39587833379a5 |
12 | 143b6228047a2 |
13 | 6a021ca021a8 |
14 | 2dd37da3b254 |
15 | 160935c54cc5 |
hex | b0901391f6a |
12133303132010 has 16 divisors (see below), whose sum is σ = 21997067551200. Its totient is φ = 4818405272016.
The previous prime is 12133303132001. The next prime is 12133303132019. The reversal of 12133303132010 is 1023130333121.
It is an interprime number because it is at equal distance from previous prime (12133303132001) and next prime (12133303132019).
It is not an unprimeable number, because it can be changed into a prime (12133303132019) 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, 4364496140 + ... + 4364498919.
It is an arithmetic number, because the mean of its divisors is an integer number (1374816721950).
Almost surely, 212133303132010 is an apocalyptic number.
12133303132010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12133303132010 is a deficient number, since it is larger than the sum of its proper divisors (9863764419190).
12133303132010 is a wasteful number, since it uses less digits than its factorization.
12133303132010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8728995205.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 12133303132010 its reverse (1023130333121), we get a palindrome (13156433465131).
The spelling of 12133303132010 in words is "twelve trillion, one hundred thirty-three billion, three hundred three million, one hundred thirty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •