Base | Representation |
---|---|
bin | 10011000000110011… |
… | …001101101101011001 |
3 | 1221200201112002000000 |
4 | 103000303031231121 |
5 | 313302104121103 |
6 | 13213414003213 |
7 | 1321614362316 |
oct | 230063155531 |
9 | 57621462000 |
10 | 20414520153 |
11 | 8726512165 |
12 | 3b58946509 |
13 | 1c04531331 |
14 | db9389d0d |
15 | 7e734baa3 |
hex | 4c0ccdb59 |
20414520153 has 28 divisors (see below), whose sum is σ = 31027144020. Its totient is φ = 13423211136.
The previous prime is 20414520149. The next prime is 20414520157. The reversal of 20414520153 is 35102541402.
20414520153 is a `hidden beast` number, since 20 + 41 + 452 + 0 + 153 = 666.
It is an interprime number because it is at equal distance from previous prime (20414520149) and next prime (20414520157).
It can be written as a sum of positive squares in 2 ways, for example, as 13130409744 + 7284110409 = 114588^2 + 85347^2 .
It is not a de Polignac number, because 20414520153 - 22 = 20414520149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20414520157) by changing a digit.
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 27 ways as a sum of consecutive naturals, for example, 138588 + ... + 245021.
Almost surely, 220414520153 is an apocalyptic number.
It is an amenable number.
20414520153 is a deficient number, since it is larger than the sum of its proper divisors (10612623867).
20414520153 is an frugal number, since it uses more digits than its factorization.
20414520153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383700 (or 383685 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 20414520153 in words is "twenty billion, four hundred fourteen million, five hundred twenty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •