Base | Representation |
---|---|
bin | 1001000110111110111000… |
… | …11001010000110101011010 |
3 | 2121220221211220021000022202 |
4 | 10203133130121100311122 |
5 | 10111142223302030242 |
6 | 110334101340250202 |
7 | 4135126035424631 |
oct | 443373431206532 |
9 | 77827756230282 |
10 | 20031130111322 |
11 | 6423177812470 |
12 | 22b6200b40962 |
13 | b23c09840355 |
14 | 4d3724802518 |
15 | 24b0c7ce2932 |
hex | 1237dc650d5a |
20031130111322 has 64 divisors (see below), whose sum is σ = 33869811225600. Its totient is φ = 8802437529600.
The previous prime is 20031130111319. The next prime is 20031130111361. The reversal of 20031130111322 is 22311103113002.
It is a happy number.
It is a super-2 number, since 2×200311301113222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20031130111294 and 20031130111303.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4947177554 + ... + 4947181602.
It is an arithmetic number, because the mean of its divisors is an integer number (529215800400).
Almost surely, 220031130111322 is an apocalyptic number.
20031130111322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20031130111322 is a deficient number, since it is larger than the sum of its proper divisors (13838681114278).
20031130111322 is a wasteful number, since it uses less digits than its factorization.
20031130111322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9639.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20031130111322 its reverse (22311103113002), we get a palindrome (42342233224324).
The spelling of 20031130111322 in words is "twenty trillion, thirty-one billion, one hundred thirty million, one hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.726 sec. • engine limits •