Base | Representation |
---|---|
bin | 1001000110011101001110… |
… | …00110001011010101111111 |
3 | 2121212020012021201101102011 |
4 | 10203032213012023111333 |
5 | 10110343214321441323 |
6 | 110321512050312051 |
7 | 4133616120416164 |
oct | 443164706132577 |
9 | 77766167641364 |
10 | 20013056046463 |
11 | 6416542442a87 |
12 | 22b27b7b88627 |
13 | b222b917a00c |
14 | 4d28cc21606b |
15 | 24a8bb1a920d |
hex | 1233a718b57f |
20013056046463 has 4 divisors (see below), whose sum is σ = 20084276886768. Its totient is φ = 19941835206160.
The previous prime is 20013056046437. The next prime is 20013056046481. The reversal of 20013056046463 is 36464065031002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20013056046463 - 233 = 20004466111871 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013056046493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35610419731 + ... + 35610420292.
It is an arithmetic number, because the mean of its divisors is an integer number (5021069221692).
Almost surely, 220013056046463 is an apocalyptic number.
20013056046463 is a deficient number, since it is larger than the sum of its proper divisors (71220840305).
20013056046463 is an equidigital number, since it uses as much as digits as its factorization.
20013056046463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71220840304.
The product of its (nonzero) digits is 311040, while the sum is 40.
The spelling of 20013056046463 in words is "twenty trillion, thirteen billion, fifty-six million, forty-six thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •