Base | Representation |
---|---|
bin | 110001010111111001… |
… | …010011010001101001 |
3 | 12001211122122202111022 |
4 | 301113321103101221 |
5 | 1332033121342010 |
6 | 40204315142225 |
7 | 3554512442303 |
oct | 612771232151 |
9 | 161748582438 |
10 | 53014246505 |
11 | 20535184070 |
12 | a336444975 |
13 | 4ccb3a193c |
14 | 27ccba4973 |
15 | 15a42eed55 |
hex | c57e53469 |
53014246505 has 16 divisors (see below), whose sum is σ = 69453099648. Its totient is φ = 38526576000.
The previous prime is 53014246423. The next prime is 53014246529. The reversal of 53014246505 is 50564241035.
It is not a de Polignac number, because 53014246505 - 232 = 48719279209 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 (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 292181 + ... + 437490.
It is an arithmetic number, because the mean of its divisors is an integer number (4340818728).
Almost surely, 253014246505 is an apocalyptic number.
53014246505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
53014246505 is a deficient number, since it is larger than the sum of its proper divisors (16438853143).
53014246505 is a wasteful number, since it uses less digits than its factorization.
53014246505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731008.
The product of its (nonzero) digits is 72000, while the sum is 35.
The spelling of 53014246505 in words is "fifty-three billion, fourteen million, two hundred forty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •