Base | Representation |
---|---|
bin | 1001011000110100111011… |
… | …1110000011011010001111 |
3 | 1100112210020002002220120111 |
4 | 2112031032332003122033 |
5 | 2323104211103131111 |
6 | 33541531024500451 |
7 | 2113515015261253 |
oct | 226151676033217 |
9 | 40483202086514 |
10 | 10322131302031 |
11 | 331a65602807a |
12 | 11a85b8a7a727 |
13 | 59b4b008c403 |
14 | 279845630263 |
15 | 12d780519a21 |
hex | 9634ef8368f |
10322131302031 has 16 divisors (see below), whose sum is σ = 10684321849440. Its totient is φ = 9960359270400.
The previous prime is 10322131301969. The next prime is 10322131302053. The reversal of 10322131302031 is 13020313122301.
It is a cyclic number.
It is not a de Polignac number, because 10322131302031 - 211 = 10322131299983 is a prime.
It is a super-2 number, since 2×103221313020312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10322131301993 and 10322131302011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10322131302061) 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, 734611956 + ... + 734626006.
It is an arithmetic number, because the mean of its divisors is an integer number (667770115590).
Almost surely, 210322131302031 is an apocalyptic number.
10322131302031 is a deficient number, since it is larger than the sum of its proper divisors (362190547409).
10322131302031 is a wasteful number, since it uses less digits than its factorization.
10322131302031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27114.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10322131302031 its reverse (13020313122301), we get a palindrome (23342444424332).
The spelling of 10322131302031 in words is "ten trillion, three hundred twenty-two billion, one hundred thirty-one million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •