Base | Representation |
---|---|
bin | 10011000111111011… |
… | …000011010100001001 |
3 | 1222000001101001110000 |
4 | 103013323003110021 |
5 | 314023201441431 |
6 | 13233323113213 |
7 | 1324565151435 |
oct | 230773032411 |
9 | 58001331400 |
10 | 20534015241 |
11 | 8787a09633 |
12 | 3b90972809 |
13 | 1c2320c49c |
14 | dcb1b39c5 |
15 | 802aa29e6 |
hex | 4c7ec3509 |
20534015241 has 10 divisors (see below), whose sum is σ = 30674269802. Its totient is φ = 13689343440.
The previous prime is 20534015231. The next prime is 20534015287. The reversal of 20534015241 is 14251043502.
20534015241 is a `hidden beast` number, since 205 + 3 + 401 + 52 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 14261375241 + 6272640000 = 119421^2 + 79200^2 .
It is not a de Polignac number, because 20534015241 - 25 = 20534015209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20534015231) 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 9 ways as a sum of consecutive naturals, for example, 126753100 + ... + 126753261.
Almost surely, 220534015241 is an apocalyptic number.
It is an amenable number.
20534015241 is a deficient number, since it is larger than the sum of its proper divisors (10140254561).
20534015241 is an equidigital number, since it uses as much as digits as its factorization.
20534015241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253506373 (or 253506364 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 20534015241 its reverse (14251043502), we get a palindrome (34785058743).
The spelling of 20534015241 in words is "twenty billion, five hundred thirty-four million, fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •