Base | Representation |
---|---|
bin | 1001000110011101010101… |
… | …11010010000111110100101 |
3 | 2121212020100202010012222221 |
4 | 10203032222322100332211 |
5 | 10110343332212021202 |
6 | 110321522253552341 |
7 | 4133620525325002 |
oct | 443165272207645 |
9 | 77766322105887 |
10 | 20013120032677 |
11 | 6416575576852 |
12 | 22b28154a56b1 |
13 | b222c94c1495 |
14 | 4d28d69108a9 |
15 | 24a8c1ae8037 |
hex | 1233aae90fa5 |
20013120032677 has 8 divisors (see below), whose sum is σ = 21066556128800. Its totient is φ = 18959695335504.
The previous prime is 20013120032651. The next prime is 20013120032701. The reversal of 20013120032677 is 77623002131002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20013120032677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013120036677) 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 7 ways as a sum of consecutive naturals, for example, 879199 + ... + 6387427.
It is an arithmetic number, because the mean of its divisors is an integer number (2633319516100).
Almost surely, 220013120032677 is an apocalyptic number.
It is an amenable number.
20013120032677 is a deficient number, since it is larger than the sum of its proper divisors (1053436096123).
20013120032677 is a wasteful number, since it uses less digits than its factorization.
20013120032677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5699475.
The product of its (nonzero) digits is 21168, while the sum is 34.
Adding to 20013120032677 its reverse (77623002131002), we get a palindrome (97636122163679).
The spelling of 20013120032677 in words is "twenty trillion, thirteen billion, one hundred twenty million, thirty-two thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •