Base | Representation |
---|---|
bin | 1011000000010101001001… |
… | …0001111111100011100111 |
3 | 1120211202222221110202200002 |
4 | 2300011102101333203213 |
5 | 3041222410122240234 |
6 | 41422445210211515 |
7 | 2356134540122513 |
oct | 260052221774347 |
9 | 46752887422602 |
10 | 12100303321319 |
11 | 3945789852784 |
12 | 1435153123b9b |
13 | 69a090cc0aa5 |
14 | 2db92d039143 |
15 | 15eb53ac327e |
hex | b015247f8e7 |
12100303321319 has 2 divisors, whose sum is σ = 12100303321320. Its totient is φ = 12100303321318.
The previous prime is 12100303321313. The next prime is 12100303321363. The reversal of 12100303321319 is 91312330300121.
It is a happy number.
12100303321319 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12100303321319 is a prime.
It is a super-2 number, since 2×121003033213192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12100303321291 and 12100303321300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12100303321313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050151660659 + 6050151660660.
It is an arithmetic number, because the mean of its divisors is an integer number (6050151660660).
Almost surely, 212100303321319 is an apocalyptic number.
12100303321319 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100303321319 is an equidigital number, since it uses as much as digits as its factorization.
12100303321319 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 12100303321319 in words is "twelve trillion, one hundred billion, three hundred three million, three hundred twenty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •