Base | Representation |
---|---|
bin | 1001001111001100100001… |
… | …11100111000110101011001 |
3 | 2122220221021001022122120210 |
4 | 10213212100330320311121 |
5 | 10130303201022121241 |
6 | 111111452131041333 |
7 | 4164406211000064 |
oct | 447462074706531 |
9 | 78827231278523 |
10 | 20313332223321 |
11 | 6521921522015 |
12 | 2340a39a40249 |
13 | b44701285087 |
14 | 503255cc98db |
15 | 2535e2c1d316 |
hex | 127990f38d59 |
20313332223321 has 64 divisors (see below), whose sum is σ = 28716180258816. Its totient is φ = 12760751808000.
The previous prime is 20313332223209. The next prime is 20313332223361. The reversal of 20313332223321 is 12332223331302.
It is not a de Polignac number, because 20313332223321 - 213 = 20313332215129 is a prime.
It is a super-2 number, since 2×203133322233212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20313332223361) 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 63 ways as a sum of consecutive naturals, for example, 73673500 + ... + 73948706.
It is an arithmetic number, because the mean of its divisors is an integer number (448690316544).
Almost surely, 220313332223321 is an apocalyptic number.
It is an amenable number.
20313332223321 is a deficient number, since it is larger than the sum of its proper divisors (8402848035495).
20313332223321 is a wasteful number, since it uses less digits than its factorization.
20313332223321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275502.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 20313332223321 its reverse (12332223331302), we get a palindrome (32645555554623).
The spelling of 20313332223321 in words is "twenty trillion, three hundred thirteen billion, three hundred thirty-two million, two hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •