Base | Representation |
---|---|
bin | 111100100010101010… |
… | …0011011110000000101 |
3 | 110102120202112002002201 |
4 | 1321011110123300011 |
5 | 4112231033101313 |
6 | 135420544234501 |
7 | 12251550536332 |
oct | 1710524336005 |
9 | 412522462081 |
10 | 130012003333 |
11 | 50157428443 |
12 | 2124490ba31 |
13 | c34c5181b4 |
14 | 6414d11989 |
15 | 35ade350dd |
hex | 1e4551bc05 |
130012003333 has 2 divisors, whose sum is σ = 130012003334. Its totient is φ = 130012003332.
The previous prime is 130012003309. The next prime is 130012003349. The reversal of 130012003333 is 333300210031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65839967649 + 64172035684 = 256593^2 + 253322^2 .
It is a cyclic number.
It is not a de Polignac number, because 130012003333 - 25 = 130012003301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130012003333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130012003733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65006001666 + 65006001667.
It is an arithmetic number, because the mean of its divisors is an integer number (65006001667).
Almost surely, 2130012003333 is an apocalyptic number.
It is an amenable number.
130012003333 is a deficient number, since it is larger than the sum of its proper divisors (1).
130012003333 is an equidigital number, since it uses as much as digits as its factorization.
130012003333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 130012003333 its reverse (333300210031), we get a palindrome (463312213364).
The spelling of 130012003333 in words is "one hundred thirty billion, twelve million, three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •