Base | Representation |
---|---|
bin | 1001001111000110111010… |
… | …11010001101100000111010 |
3 | 2122220122111010022102112102 |
4 | 10213203131122031200322 |
5 | 10130231013410330242 |
6 | 111110233204543402 |
7 | 4164241443422645 |
oct | 447433532154072 |
9 | 78818433272472 |
10 | 20310320011322 |
11 | 6520616180610 |
12 | 23403390b1b62 |
13 | b443411b6203 |
14 | 50304bc24a5c |
15 | 2534b8565e32 |
hex | 1278dd68d83a |
20310320011322 has 32 divisors (see below), whose sum is σ = 33942684441600. Its totient is φ = 9035409455280.
The previous prime is 20310320011321. The next prime is 20310320011391. The reversal of 20310320011322 is 22311002301302.
It is a junction number, because it is equal to n+sod(n) for n = 20310320011294 and 20310320011303.
It is not an unprimeable number, because it can be changed into a prime (20310320011321) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 132758429 + ... + 132911327.
It is an arithmetic number, because the mean of its divisors is an integer number (1060708888800).
Almost surely, 220310320011322 is an apocalyptic number.
20310320011322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20310320011322 is a deficient number, since it is larger than the sum of its proper divisors (13632364430278).
20310320011322 is a wasteful number, since it uses less digits than its factorization.
20310320011322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281426.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20310320011322 its reverse (22311002301302), we get a palindrome (42621322312624).
The spelling of 20310320011322 in words is "twenty trillion, three hundred ten billion, three hundred twenty million, eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •