Base | Representation |
---|---|
bin | 1010111100001111001111… |
… | …1101001100010001010101 |
3 | 1120121001112110212202011021 |
4 | 2233003303331030101111 |
5 | 3034044420320131313 |
6 | 41330301210441141 |
7 | 2351065435103434 |
oct | 257036375142125 |
9 | 46531473782137 |
10 | 12030001333333 |
11 | 3918993149665 |
12 | 14235b31331b1 |
13 | 693569130829 |
14 | 2d838029311b |
15 | 15cddbc0e78d |
hex | af0f3f4c455 |
12030001333333 has 2 divisors, whose sum is σ = 12030001333334. Its totient is φ = 12030001333332.
The previous prime is 12030001333303. The next prime is 12030001333351. The reversal of 12030001333333 is 33333310003021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11623476499684 + 406524833649 = 3409322^2 + 637593^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12030001333333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12030001333298 and 12030001333307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12030001333303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6015000666666 + 6015000666667.
It is an arithmetic number, because the mean of its divisors is an integer number (6015000666667).
Almost surely, 212030001333333 is an apocalyptic number.
It is an amenable number.
12030001333333 is a deficient number, since it is larger than the sum of its proper divisors (1).
12030001333333 is an equidigital number, since it uses as much as digits as its factorization.
12030001333333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 12030001333333 its reverse (33333310003021), we get a palindrome (45363311336354).
The spelling of 12030001333333 in words is "twelve trillion, thirty billion, one million, three hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •