Base | Representation |
---|---|
bin | 10010101000011111… |
… | …00100111010110010 |
3 | 221211010222111111222 |
4 | 21110033210322302 |
5 | 130441321212424 |
6 | 4332341305042 |
7 | 502614452636 |
oct | 112417447262 |
9 | 27733874458 |
10 | 10003304114 |
11 | 4273671491 |
12 | 1b32105182 |
13 | c355a637b |
14 | 6ac782dc6 |
15 | 3d8311e5e |
hex | 2543e4eb2 |
10003304114 has 4 divisors (see below), whose sum is σ = 15004956174. Its totient is φ = 5001652056.
The previous prime is 10003304083. The next prime is 10003304117. The reversal of 10003304114 is 41140330001.
10003304114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 41140330001 = 29 ⋅1418632069.
It can be written as a sum of positive squares in only one way, i.e., 6883523089 + 3119781025 = 82967^2 + 55855^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10003304092 and 10003304101.
It is not an unprimeable number, because it can be changed into a prime (10003304117) 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, 2500826027 + ... + 2500826030.
Almost surely, 210003304114 is an apocalyptic number.
10003304114 is a deficient number, since it is larger than the sum of its proper divisors (5001652060).
10003304114 is an equidigital number, since it uses as much as digits as its factorization.
10003304114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5001652059.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10003304114 its reverse (41140330001), we get a palindrome (51143634115).
The spelling of 10003304114 in words is "ten billion, three million, three hundred four thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •