Base | Representation |
---|---|
bin | 10010101001011110… |
… | …101011110100000001 |
3 | 1220200110022010100112 |
4 | 102221132223310001 |
5 | 312001423344330 |
6 | 13110520001105 |
7 | 1306123631333 |
oct | 225136536401 |
9 | 56613263315 |
10 | 20023262465 |
11 | 85456784a8 |
12 | 3a69900195 |
13 | 1b71460ccb |
14 | d7d41d453 |
15 | 7c2d13795 |
hex | 4a97abd01 |
20023262465 has 8 divisors (see below), whose sum is σ = 24481272168. Its totient is φ = 15716371840.
The previous prime is 20023262459. The next prime is 20023262471. The reversal of 20023262465 is 56426232002.
It is an interprime number because it is at equal distance from previous prime (20023262459) and next prime (20023262471).
It can be written as a sum of positive squares in 4 ways, for example, as 2182851841 + 17840410624 = 46721^2 + 133568^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20023262465 - 24 = 20023262449 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37779476 + ... + 37780005.
It is an arithmetic number, because the mean of its divisors is an integer number (3060159021).
Almost surely, 220023262465 is an apocalyptic number.
It is an amenable number.
20023262465 is a deficient number, since it is larger than the sum of its proper divisors (4458009703).
20023262465 is an equidigital number, since it uses as much as digits as its factorization.
20023262465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75559539.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 20023262465 its reverse (56426232002), we get a palindrome (76449494467).
The spelling of 20023262465 in words is "twenty billion, twenty-three million, two hundred sixty-two thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •