Base | Representation |
---|---|
bin | 1001010100000101100… |
… | …11100011000110111011 |
3 | 1010121000220002200012101 |
4 | 10222002303203012323 |
5 | 20220401131144011 |
6 | 403003252524231 |
7 | 32056306142443 |
oct | 4520263430673 |
9 | 1117026080171 |
10 | 320022131131 |
11 | 1137a217180a |
12 | 52032920677 |
13 | 24240c84991 |
14 | 116bc349123 |
15 | 84d034c2c1 |
hex | 4a82ce31bb |
320022131131 has 16 divisors (see below), whose sum is σ = 340641218016. Its totient is φ = 299603078656.
The previous prime is 320022131113. The next prime is 320022131137. The reversal of 320022131131 is 131131220023.
It is a cyclic number.
It is not a de Polignac number, because 320022131131 - 211 = 320022129083 is a prime.
It is a super-2 number, since 2×3200221311312 (a number of 24 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 = 320022131099 and 320022131108.
It is not an unprimeable number, because it can be changed into a prime (320022131137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22856625 + ... + 22870621.
It is an arithmetic number, because the mean of its divisors is an integer number (21290076126).
Almost surely, 2320022131131 is an apocalyptic number.
320022131131 is a deficient number, since it is larger than the sum of its proper divisors (20619086885).
320022131131 is a wasteful number, since it uses less digits than its factorization.
320022131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21038.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 320022131131 its reverse (131131220023), we get a palindrome (451153351154).
The spelling of 320022131131 in words is "three hundred twenty billion, twenty-two million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •