Base | Representation |
---|---|
bin | 10010111100101100… |
… | …011010000000101001 |
3 | 1221111220212220220100 |
4 | 102330230122000221 |
5 | 313131440023130 |
6 | 13202513220013 |
7 | 1320116654550 |
oct | 227454320051 |
9 | 57456786810 |
10 | 20345626665 |
11 | 86a06374a1 |
12 | 3b39861609 |
13 | 1bc318c360 |
14 | db0174d97 |
15 | 7e128dc60 |
hex | 4bcb1a029 |
20345626665 has 48 divisors (see below), whose sum is σ = 43404012288. Its totient is φ = 8585405568.
The previous prime is 20345626661. The next prime is 20345626669. The reversal of 20345626665 is 56662654302.
It is an interprime number because it is at equal distance from previous prime (20345626661) and next prime (20345626669).
It is not a de Polignac number, because 20345626665 - 22 = 20345626661 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 20345626665.
It is not an unprimeable number, because it can be changed into a prime (20345626661) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2480109 + ... + 2488298.
It is an arithmetic number, because the mean of its divisors is an integer number (904250256).
Almost surely, 220345626665 is an apocalyptic number.
It is an amenable number.
20345626665 is an abundant number, since it is smaller than the sum of its proper divisors (23058385623).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20345626665 is a wasteful number, since it uses less digits than its factorization.
20345626665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4968438 (or 4968435 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 45.
The spelling of 20345626665 in words is "twenty billion, three hundred forty-five million, six hundred twenty-six thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •