Base | Representation |
---|---|
bin | 1001001111001100001011… |
… | …10011100001101111000011 |
3 | 2122220220210000102220022011 |
4 | 10213212011303201233003 |
5 | 10130302310134020120 |
6 | 111111421410553351 |
7 | 4164401450333023 |
oct | 447460563415703 |
9 | 78826700386264 |
10 | 20313145220035 |
11 | 6521835a06748 |
12 | 23409a7298857 |
13 | b446a15cb645 |
14 | 50323912ba83 |
15 | 2535d15cec5a |
hex | 127985ce1bc3 |
20313145220035 has 8 divisors (see below), whose sum is σ = 24389234117136. Its totient is φ = 16241542940640.
The previous prime is 20313145220009. The next prime is 20313145220141. The reversal of 20313145220035 is 53002254131302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20313145220035 - 229 = 20312608349123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20313145219979 and 20313145220006.
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 7 ways as a sum of consecutive naturals, for example, 1121644464 + ... + 1121662573.
It is an arithmetic number, because the mean of its divisors is an integer number (3048654264642).
Almost surely, 220313145220035 is an apocalyptic number.
20313145220035 is a deficient number, since it is larger than the sum of its proper divisors (4076088897101).
20313145220035 is a wasteful number, since it uses less digits than its factorization.
20313145220035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2243308853.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 20313145220035 its reverse (53002254131302), we get a palindrome (73315399351337).
The spelling of 20313145220035 in words is "twenty trillion, three hundred thirteen billion, one hundred forty-five million, two hundred twenty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •