Base | Representation |
---|---|
bin | 1001010011011101110011… |
… | …1000110011111100100011 |
3 | 1100012222110220002222102001 |
4 | 2110313130320303330203 |
5 | 2320102041342342011 |
6 | 33431335132304431 |
7 | 2104044335603026 |
oct | 224673470637443 |
9 | 40188426088361 |
10 | 10230023012131 |
11 | 329458a32663a |
12 | 1192792012117 |
13 | 5928c1538c20 |
14 | 2751c87291bd |
15 | 12b18e0397c1 |
hex | 94ddce33f23 |
10230023012131 has 16 divisors (see below), whose sum is σ = 11089326324384. Its totient is φ = 9381201951744.
The previous prime is 10230023012117. The next prime is 10230023012159. The reversal of 10230023012131 is 13121032003201.
It is a cyclic number.
It is not a de Polignac number, because 10230023012131 - 219 = 10230022487843 is a prime.
It is a super-2 number, since 2×102300230121312 (a number of 27 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 = 10230023012099 and 10230023012108.
It is not an unprimeable number, because it can be changed into a prime (10230023012101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1244161 + ... + 4691266.
It is an arithmetic number, because the mean of its divisors is an integer number (693082895274).
Almost surely, 210230023012131 is an apocalyptic number.
10230023012131 is a deficient number, since it is larger than the sum of its proper divisors (859303312253).
10230023012131 is a wasteful number, since it uses less digits than its factorization.
10230023012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5936310.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10230023012131 its reverse (13121032003201), we get a palindrome (23351055015332).
The spelling of 10230023012131 in words is "ten trillion, two hundred thirty billion, twenty-three million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •