Base | Representation |
---|---|
bin | 100100011000011110000000… |
… | …1010100010101101011001011 |
3 | 1112222002211120102210220221220 |
4 | 1020300330001110111223023 |
5 | 313421221213024114011 |
6 | 3052344121242133123 |
7 | 124256564451111513 |
oct | 11060740124255313 |
9 | 1488084512726856 |
10 | 320022330301131 |
11 | 92a72787543287 |
12 | 2ba8657aab11a3 |
13 | 10974c8cab7693 |
14 | 5905240654843 |
15 | 26ee7add1a506 |
hex | 1230f01515acb |
320022330301131 has 8 divisors (see below), whose sum is σ = 428214933073104. Its totient is φ = 212588973864960.
The previous prime is 320022330301081. The next prime is 320022330301169. The reversal of 320022330301131 is 131103033220023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320022330301131 - 26 = 320022330301067 is a prime.
It is a super-2 number, since 2×3200223303011312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (320022330300131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189811582966 + ... + 189811584651.
It is an arithmetic number, because the mean of its divisors is an integer number (53526866634138).
Almost surely, 2320022330301131 is an apocalyptic number.
320022330301131 is a deficient number, since it is larger than the sum of its proper divisors (108192602771973).
320022330301131 is a wasteful number, since it uses less digits than its factorization.
320022330301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379623167901.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 320022330301131 its reverse (131103033220023), we get a palindrome (451125363521154).
The spelling of 320022330301131 in words is "three hundred twenty trillion, twenty-two billion, three hundred thirty million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •