Base | Representation |
---|---|
bin | 1001001100000101101110… |
… | …0110111001001010111001 |
3 | 1022202212101100102002110111 |
4 | 2103001123212321022321 |
5 | 2311013024300034424 |
6 | 33253220354344321 |
7 | 2061640123025311 |
oct | 223013346711271 |
9 | 38685340362414 |
10 | 10103300002489 |
11 | 3245870505901 |
12 | 117210688b0a1 |
13 | 58397754b455 |
14 | 26d00656a441 |
15 | 127c23c31194 |
hex | 9305b9b92b9 |
10103300002489 has 2 divisors, whose sum is σ = 10103300002490. Its totient is φ = 10103300002488.
The previous prime is 10103300002451. The next prime is 10103300002507. The reversal of 10103300002489 is 98420000330101.
10103300002489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6329838350889 + 3773461651600 = 2515917^2 + 1942540^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103300002489 - 231 = 10101152518841 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10103300002489.
It is not a weakly prime, because it can be changed into another prime (10103300002589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051650001244 + 5051650001245.
It is an arithmetic number, because the mean of its divisors is an integer number (5051650001245).
Almost surely, 210103300002489 is an apocalyptic number.
It is an amenable number.
10103300002489 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103300002489 is an equidigital number, since it uses as much as digits as its factorization.
10103300002489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 10103300002489 in words is "ten trillion, one hundred three billion, three hundred million, two thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •