Base | Representation |
---|---|
bin | 1010111010101011110100… |
… | …0011000110000111110101 |
3 | 1120111111122100001022100111 |
4 | 2232222331003012013311 |
5 | 3033130234421032412 |
6 | 41310124501543021 |
7 | 2346132135241303 |
oct | 256527503060765 |
9 | 46444570038314 |
10 | 12003310330357 |
11 | 3908636835015 |
12 | 141a3a4414a71 |
13 | 690ba447ac48 |
14 | 2d6d6b4c7273 |
15 | 15c3788642a7 |
hex | aeabd0c61f5 |
12003310330357 has 2 divisors, whose sum is σ = 12003310330358. Its totient is φ = 12003310330356.
The previous prime is 12003310330289. The next prime is 12003310330399. The reversal of 12003310330357 is 75303301330021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8958054986001 + 3045255344356 = 2993001^2 + 1745066^2 .
It is an emirp because it is prime and its reverse (75303301330021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12003310330357 - 231 = 12001162846709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12003310330157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001655165178 + 6001655165179.
It is an arithmetic number, because the mean of its divisors is an integer number (6001655165179).
Almost surely, 212003310330357 is an apocalyptic number.
It is an amenable number.
12003310330357 is a deficient number, since it is larger than the sum of its proper divisors (1).
12003310330357 is an equidigital number, since it uses as much as digits as its factorization.
12003310330357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17010, while the sum is 31.
Adding to 12003310330357 its reverse (75303301330021), we get a palindrome (87306611660378).
The spelling of 12003310330357 in words is "twelve trillion, three billion, three hundred ten million, three hundred thirty thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •