Base | Representation |
---|---|
bin | 101111100101110011… |
… | …1010100111011110111 |
3 | 100202210111221210100100 |
4 | 1133023213110323313 |
5 | 3133301241111043 |
6 | 114541123445143 |
7 | 10245422326446 |
oct | 1371347247367 |
9 | 322714853310 |
10 | 102200332023 |
11 | 3a385472119 |
12 | 179828267b3 |
13 | 983962925a |
14 | 4d37386d5d |
15 | 29d24becd3 |
hex | 17cb9d4ef7 |
102200332023 has 12 divisors (see below), whose sum is σ = 147625672480. Its totient is φ = 68132183616.
The previous prime is 102200332009. The next prime is 102200332037. The reversal of 102200332023 is 320233002201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102200332009) and next prime (102200332037).
It is not a de Polignac number, because 102200332023 - 228 = 101931896567 is a prime.
It is a super-2 number, since 2×1022003320232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200331987 and 102200332005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200334023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 579615 + ... + 735087.
Almost surely, 2102200332023 is an apocalyptic number.
102200332023 is a deficient number, since it is larger than the sum of its proper divisors (45425340457).
102200332023 is a wasteful number, since it uses less digits than its factorization.
102200332023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228518 (or 228515 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 102200332023 its reverse (320233002201), we get a palindrome (422433334224).
The spelling of 102200332023 in words is "one hundred two billion, two hundred million, three hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •