Base | Representation |
---|---|
bin | 10011000000010010… |
… | …11011101101010111 |
3 | 222100001210010101001 |
4 | 21200021123231113 |
5 | 131343433120434 |
6 | 4404234044131 |
7 | 510561145225 |
oct | 114011335527 |
9 | 28301703331 |
10 | 10203020119 |
11 | 4366380036 |
12 | 1b88b79647 |
13 | c67a91316 |
14 | 6cb0cdb15 |
15 | 3eab12114 |
hex | 26025bb57 |
10203020119 has 2 divisors, whose sum is σ = 10203020120. Its totient is φ = 10203020118.
The previous prime is 10203020081. The next prime is 10203020123. The reversal of 10203020119 is 91102030201.
10203020119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10203020119 - 211 = 10203018071 is a prime.
It is a super-2 number, since 2×102030201192 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10203020096 and 10203020105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10203020819) 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, 5101510059 + 5101510060.
It is an arithmetic number, because the mean of its divisors is an integer number (5101510060).
Almost surely, 210203020119 is an apocalyptic number.
10203020119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10203020119 is an equidigital number, since it uses as much as digits as its factorization.
10203020119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Subtracting from 10203020119 its sum of digits (19), we obtain a square (10203020100 = 1010102).
The spelling of 10203020119 in words is "ten billion, two hundred three million, twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •