Base | Representation |
---|---|
bin | 110001110101011000… |
… | …110100111011011000 |
3 | 12010010010201101101100 |
4 | 301311120310323120 |
5 | 1334041304100242 |
6 | 40325352351400 |
7 | 3603001264302 |
oct | 616530647330 |
9 | 163103641340 |
10 | 53509050072 |
11 | 20769511335 |
12 | a4540a5560 |
13 | 5079a5770a |
14 | 28387a6972 |
15 | 15d298d54c |
hex | c75634ed8 |
53509050072 has 24 divisors (see below), whose sum is σ = 144920344140. Its totient is φ = 17836350000.
The previous prime is 53509050071. The next prime is 53509050073. The reversal of 53509050072 is 27005090535.
53509050072 is a `hidden beast` number, since 535 + 0 + 9 + 0 + 50 + 0 + 72 = 666.
It is an interprime number because it is at equal distance from previous prime (53509050071) and next prime (53509050073).
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53509050071) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 371590554 + ... + 371590697.
Almost surely, 253509050072 is an apocalyptic number.
It is an amenable number.
53509050072 is an abundant number, since it is smaller than the sum of its proper divisors (91411294068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53509050072 is a wasteful number, since it uses less digits than its factorization.
53509050072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743181263 (or 743181256 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 36.
The spelling of 53509050072 in words is "fifty-three billion, five hundred nine million, fifty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •