Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …0000111101100110011111 |
3 | 1100110202222002012221112100 |
4 | 2111321222000331212133 |
5 | 2322233133203304043 |
6 | 33524133101540143 |
7 | 2112142054050420 |
oct | 225715200754637 |
9 | 40422862187470 |
10 | 10301110213023 |
11 | 3311749190843 |
12 | 11a4510b74653 |
13 | 59950cca25c6 |
14 | 27880d8ab647 |
15 | 12ce4ed03cd3 |
hex | 95e6a03d99f |
10301110213023 has 12 divisors (see below), whose sum is σ = 17005007335888. Its totient is φ = 5886348693120.
The previous prime is 10301110213019. The next prime is 10301110213067. The reversal of 10301110213023 is 32031201110301.
It is not a de Polignac number, because 10301110213023 - 22 = 10301110213019 is a prime.
It is a super-4 number, since 4×103011102130234 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10301110212987 and 10301110213005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301110215023) 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, 81754842898 + ... + 81754843023.
Almost surely, 210301110213023 is an apocalyptic number.
10301110213023 is a deficient number, since it is larger than the sum of its proper divisors (6703897122865).
10301110213023 is a wasteful number, since it uses less digits than its factorization.
10301110213023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163509685934 (or 163509685931 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10301110213023 its reverse (32031201110301), we get a palindrome (42332311323324).
The spelling of 10301110213023 in words is "ten trillion, three hundred one billion, one hundred ten million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •