Base | Representation |
---|---|
bin | 11010110001111000001… |
… | …01101101011010010101 |
3 | 10020222000112001111102212 |
4 | 31120330011231122111 |
5 | 110033412032143104 |
6 | 1542411415243205 |
7 | 123322464365435 |
oct | 15307405553225 |
9 | 3228015044385 |
10 | 920131131029 |
11 | 325253043570 |
12 | 12a3b2079505 |
13 | 689ca387266 |
14 | 3276ac842c5 |
15 | 18e04a4b36e |
hex | d63c16d695 |
920131131029 has 16 divisors (see below), whose sum is σ = 1030800266496. Its totient is φ = 814162132800.
The previous prime is 920131131019. The next prime is 920131131043.
It is a happy number.
920131131029 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-920131131029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 920131130986 and 920131131004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (920131131019) 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, 4822862 + ... + 5010015.
It is an arithmetic number, because the mean of its divisors is an integer number (64425016656).
Almost surely, 2920131131029 is an apocalyptic number.
It is an amenable number.
920131131029 is a deficient number, since it is larger than the sum of its proper divisors (110669135467).
920131131029 is a wasteful number, since it uses less digits than its factorization.
920131131029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9833116.
The product of its (nonzero) digits is 2916, while the sum is 32.
The spelling of 920131131029 in words is "nine hundred twenty billion, one hundred thirty-one million, one hundred thirty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •