Base | Representation |
---|---|
bin | 1000101110110100001… |
… | …10111111101000110001 |
3 | 1001200101100112012102011 |
4 | 10113122012333220301 |
5 | 14403411033310113 |
6 | 345453522322521 |
7 | 30450402003121 |
oct | 4273206775061 |
9 | 1050340465364 |
10 | 300012010033 |
11 | 106263a5a64a |
12 | 4a1894b9441 |
13 | 223a2475338 |
14 | 1074098ac81 |
15 | 7c0d78263d |
hex | 45da1bfa31 |
300012010033 has 2 divisors, whose sum is σ = 300012010034. Its totient is φ = 300012010032.
The previous prime is 300012010031. The next prime is 300012010037. The reversal of 300012010033 is 330010210003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 258438023424 + 41573986609 = 508368^2 + 203897^2 .
It is a cyclic number.
It is not a de Polignac number, because 300012010033 - 21 = 300012010031 is a prime.
It is a super-2 number, since 2×3000120100332 (a number of 24 digits) contains 22 as substring.
Together with 300012010031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 300012009995 and 300012010022.
It is not a weakly prime, because it can be changed into another prime (300012010031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150006005016 + 150006005017.
It is an arithmetic number, because the mean of its divisors is an integer number (150006005017).
Almost surely, 2300012010033 is an apocalyptic number.
It is an amenable number.
300012010033 is a deficient number, since it is larger than the sum of its proper divisors (1).
300012010033 is an equidigital number, since it uses as much as digits as its factorization.
300012010033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 300012010033 its reverse (330010210003), we get a palindrome (630022220036).
The spelling of 300012010033 in words is "three hundred billion, twelve million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •