Base | Representation |
---|---|
bin | 1001001101101001100100… |
… | …1100010011000111001111 |
3 | 1022212102120022000120002222 |
4 | 2103122121030103013033 |
5 | 2311432422333201111 |
6 | 33313412144205555 |
7 | 2063606252651366 |
oct | 223323114230717 |
9 | 38772508016088 |
10 | 10130103022031 |
11 | 3256175079123 |
12 | 11773470098bb |
13 | 586359491225 |
14 | 27042a1747dd |
15 | 128791d567db |
hex | 936993131cf |
10130103022031 has 32 divisors (see below), whose sum is σ = 11222834588160. Its totient is φ = 9108889105536.
The previous prime is 10130103021911. The next prime is 10130103022079. The reversal of 10130103022031 is 13022030103101.
10130103022031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10130103022031 - 226 = 10130035913167 is a prime.
It is a super-2 number, since 2×101301030220312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130103022531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3807365 + ... + 5895441.
It is an arithmetic number, because the mean of its divisors is an integer number (350713580880).
Almost surely, 210130103022031 is an apocalyptic number.
10130103022031 is a deficient number, since it is larger than the sum of its proper divisors (1092731566129).
10130103022031 is a wasteful number, since it uses less digits than its factorization.
10130103022031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2088303.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10130103022031 its reverse (13022030103101), we get a palindrome (23152133125132).
The spelling of 10130103022031 in words is "ten trillion, one hundred thirty billion, one hundred three million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •