Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …01111001000101011100001 |
3 | 2121211012020010101002221011 |
4 | 10203010201033020223201 |
5 | 10110204021400011223 |
6 | 110312520531100521 |
7 | 4133053444253350 |
oct | 443044117105341 |
9 | 77735203332834 |
10 | 20002220313313 |
11 | 6411991a01317 |
12 | 22b0693141741 |
13 | b212802a82b4 |
14 | 4d21810a5997 |
15 | 24a484c6680d |
hex | 1231213c8ae1 |
20002220313313 has 8 divisors (see below), whose sum is σ = 22859713801280. Its totient is φ = 17144735186160.
The previous prime is 20002220313301. The next prime is 20002220313337. The reversal of 20002220313313 is 31331302220002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20002220313313 - 213 = 20002220305121 is a prime.
It is a super-2 number, since 2×200022203133132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20002220313613) 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, 4365643 + ... + 7685263.
It is an arithmetic number, because the mean of its divisors is an integer number (2857464225160).
Almost surely, 220002220313313 is an apocalyptic number.
It is an amenable number.
20002220313313 is a deficient number, since it is larger than the sum of its proper divisors (2857493487967).
20002220313313 is an equidigital number, since it uses as much as digits as its factorization.
20002220313313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4180407.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20002220313313 its reverse (31331302220002), we get a palindrome (51333522533315).
The spelling of 20002220313313 in words is "twenty trillion, two billion, two hundred twenty million, three hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •