Base | Representation |
---|---|
bin | 10010101001011011… |
… | …01100111010110011 |
3 | 221211200211201021202 |
4 | 21110231230322303 |
5 | 131000331414303 |
6 | 4333222441415 |
7 | 503041543343 |
oct | 112455547263 |
9 | 27750751252 |
10 | 10011201203 |
11 | 4278075703 |
12 | 1b3489326b |
13 | c3710c9c3 |
14 | 6ad83ad23 |
15 | 3d8d71c88 |
hex | 254b6ceb3 |
10011201203 has 4 divisors (see below), whose sum is σ = 10011863688. Its totient is φ = 10010538720.
The previous prime is 10011201197. The next prime is 10011201209. The reversal of 10011201203 is 30210211001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30210211001 = 164911 ⋅183191.
It is an interprime number because it is at equal distance from previous prime (10011201197) and next prime (10011201209).
It is a cyclic number.
It is not a de Polignac number, because 10011201203 - 212 = 10011197107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011201209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 308033 + ... + 338978.
It is an arithmetic number, because the mean of its divisors is an integer number (2502965922).
Almost surely, 210011201203 is an apocalyptic number.
10011201203 is a deficient number, since it is larger than the sum of its proper divisors (662485).
10011201203 is an equidigital number, since it uses as much as digits as its factorization.
10011201203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662484.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10011201203 its reverse (30210211001), we get a palindrome (40221412204).
The spelling of 10011201203 in words is "ten billion, eleven million, two hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •