Base | Representation |
---|---|
bin | 1010111100010100001100… |
… | …1110001110110100111111 |
3 | 1120121011222011020222201002 |
4 | 2233011003032032310333 |
5 | 3034110131241402234 |
6 | 41331041154240515 |
7 | 2351143413556604 |
oct | 257050316166477 |
9 | 46534864228632 |
10 | 12031331200319 |
11 | 3919505896392 |
12 | 142390458613b |
13 | 69371b7c5082 |
14 | 2d8468b4a6ab |
15 | 15ce6884e27e |
hex | af14338ed3f |
12031331200319 has 2 divisors, whose sum is σ = 12031331200320. Its totient is φ = 12031331200318.
The previous prime is 12031331200283. The next prime is 12031331200333. The reversal of 12031331200319 is 91300213313021.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (91300213313021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12031331200319 - 240 = 10931819572543 is a prime.
It is a super-2 number, since 2×120313312003192 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 12031331200291 and 12031331200300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12031331200519) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6015665600159 + 6015665600160.
It is an arithmetic number, because the mean of its divisors is an integer number (6015665600160).
Almost surely, 212031331200319 is an apocalyptic number.
12031331200319 is a deficient number, since it is larger than the sum of its proper divisors (1).
12031331200319 is an equidigital number, since it uses as much as digits as its factorization.
12031331200319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 12031331200319 in words is "twelve trillion, thirty-one billion, three hundred thirty-one million, two hundred thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •