Base | Representation |
---|---|
bin | 10010110111100110… |
… | …00000100101101011 |
3 | 222010222102222212112 |
4 | 21123303000211223 |
5 | 131221242024003 |
6 | 4353105432535 |
7 | 506013600626 |
oct | 113363004553 |
9 | 28128388775 |
10 | 10130033003 |
11 | 4329159802 |
12 | 1b6863b74b |
13 | c55917c8c |
14 | 6c1530dbd |
15 | 3e44e63d8 |
hex | 25bcc096b |
10130033003 has 2 divisors, whose sum is σ = 10130033004. Its totient is φ = 10130033002.
The previous prime is 10130032987. The next prime is 10130033033. The reversal of 10130033003 is 30033003101.
10130033003 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 an emirp because it is prime and its reverse (30033003101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10130033003 - 24 = 10130032987 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10130033033) 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, 5065016501 + 5065016502.
It is an arithmetic number, because the mean of its divisors is an integer number (5065016502).
Almost surely, 210130033003 is an apocalyptic number.
10130033003 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130033003 is an equidigital number, since it uses as much as digits as its factorization.
10130033003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 14.
Adding to 10130033003 its reverse (30033003101), we get a palindrome (40163036104).
It can be divided in two parts, 101 and 30033003, that multiplied together give a palindrome (3033333303).
The spelling of 10130033003 in words is "ten billion, one hundred thirty million, thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.075 sec. • engine limits •