Base | Representation |
---|---|
bin | 10111011100010100011110… |
… | …100001110011110101010111 |
3 | 111112001101020001020011122100 |
4 | 113130110132201303311113 |
5 | 102003202230220320043 |
6 | 1003140012142533143 |
7 | 30500546621213052 |
oct | 2734243641636527 |
9 | 445041201204570 |
10 | 103101202120023 |
11 | 2a93aa79832578 |
12 | b691853b971b3 |
13 | 456b52b53c9b3 |
14 | 1b661a668ba99 |
15 | bdbd73a56cd3 |
hex | 5dc51e873d57 |
103101202120023 has 12 divisors (see below), whose sum is σ = 149040396444160. Its totient is φ = 68680394211456.
The previous prime is 103101202119953. The next prime is 103101202120109. The reversal of 103101202120023 is 320021202101301.
103101202120023 is a `hidden beast` number, since 1 + 0 + 310 + 120 + 212 + 0 + 0 + 23 = 666.
It is not a de Polignac number, because 103101202120023 - 218 = 103101201857879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103101202119978 and 103101202120005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101202120123) 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, 4478365786 + ... + 4478388807.
Almost surely, 2103101202120023 is an apocalyptic number.
103101202120023 is a deficient number, since it is larger than the sum of its proper divisors (45939194324137).
103101202120023 is a wasteful number, since it uses less digits than its factorization.
103101202120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8956755878 (or 8956755875 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 103101202120023 its reverse (320021202101301), we get a palindrome (423122404221324).
The spelling of 103101202120023 in words is "one hundred three trillion, one hundred one billion, two hundred two million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •