Base | Representation |
---|---|
bin | 1011001100001000010100… |
… | …1101101101100101000001 |
3 | 1121120011020201010002000210 |
4 | 2303002011031231211001 |
5 | 3103033041423100113 |
6 | 42055532512104333 |
7 | 2406602223402642 |
oct | 263020515554501 |
9 | 47504221102023 |
10 | 12303021300033 |
11 | 3a1375586a582 |
12 | 14684a8b350a9 |
13 | 6b322944ca99 |
14 | 3076800ad6c9 |
15 | 16506a97e6c3 |
hex | b308536d941 |
12303021300033 has 32 divisors (see below), whose sum is σ = 16825305784320. Its totient is φ = 7992891728640.
The previous prime is 12303021300029. The next prime is 12303021300091. The reversal of 12303021300033 is 33000312030321.
It is not a de Polignac number, because 12303021300033 - 22 = 12303021300029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12303021299982 and 12303021300009.
It is not an unprimeable number, because it can be changed into a prime (12303021308033) 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 31 ways as a sum of consecutive naturals, for example, 236447766 + ... + 236499792.
It is an arithmetic number, because the mean of its divisors is an integer number (525790805760).
Almost surely, 212303021300033 is an apocalyptic number.
It is an amenable number.
12303021300033 is a deficient number, since it is larger than the sum of its proper divisors (4522284484287).
12303021300033 is a wasteful number, since it uses less digits than its factorization.
12303021300033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59277.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 12303021300033 its reverse (33000312030321), we get a palindrome (45303333330354).
The spelling of 12303021300033 in words is "twelve trillion, three hundred three billion, twenty-one million, three hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •