Base | Representation |
---|---|
bin | 10010110101110111… |
… | …001001011111110111 |
3 | 1221012221012101120012 |
4 | 102311313021133313 |
5 | 312413114031403 |
6 | 13143300330435 |
7 | 1314225452264 |
oct | 226567113767 |
9 | 57187171505 |
10 | 20231002103 |
11 | 8641967354 |
12 | 3b073a3a1b |
13 | 1ba54c8080 |
14 | d9cc5826b |
15 | 7d619aed8 |
hex | 4b5dc97f7 |
20231002103 has 8 divisors (see below), whose sum is σ = 22293913488. Its totient is φ = 18240473664.
The previous prime is 20231002097. The next prime is 20231002109. The reversal of 20231002103 is 30120013202.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20231002097) and next prime (20231002109).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20231002103 - 228 = 19962566647 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20231002109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18095150 + ... + 18096267.
It is an arithmetic number, because the mean of its divisors is an integer number (2786739186).
Almost surely, 220231002103 is an apocalyptic number.
20231002103 is a deficient number, since it is larger than the sum of its proper divisors (2062911385).
20231002103 is a wasteful number, since it uses less digits than its factorization.
20231002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36191473.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20231002103 its reverse (30120013202), we get a palindrome (50351015305).
The spelling of 20231002103 in words is "twenty billion, two hundred thirty-one million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •