Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0011010100000110111 |
3 | 100120011120110200200112 |
4 | 1131021222122200313 |
5 | 3114320121300343 |
6 | 113540521533235 |
7 | 10140406564325 |
oct | 1351152324067 |
9 | 316146420615 |
10 | 100020103223 |
11 | 39466816a37 |
12 | 1747464421b |
13 | 957ca2ab41 |
14 | 4bab9b4d15 |
15 | 2905dab218 |
hex | 1749a9a837 |
100020103223 has 2 divisors, whose sum is σ = 100020103224. Its totient is φ = 100020103222.
The previous prime is 100020103219. The next prime is 100020103277. The reversal of 100020103223 is 322301020001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100020103223 - 22 = 100020103219 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 100020103198 and 100020103207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100020103213) 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 as a sum of consecutive naturals, namely, 50010051611 + 50010051612.
It is an arithmetic number, because the mean of its divisors is an integer number (50010051612).
Almost surely, 2100020103223 is an apocalyptic number.
100020103223 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020103223 is an equidigital number, since it uses as much as digits as its factorization.
100020103223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 100020103223 its reverse (322301020001), we get a palindrome (422321123224).
The spelling of 100020103223 in words is "one hundred billion, twenty million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •