Base | Representation |
---|---|
bin | 110000110111010001… |
… | …111011101010001000 |
3 | 12000102112000120012011 |
4 | 300313101323222020 |
5 | 1324423031231430 |
6 | 40034131025304 |
7 | 3535116416425 |
oct | 606721735210 |
9 | 160375016164 |
10 | 52467055240 |
11 | 20284315186 |
12 | a20313b234 |
13 | 4c41c05a22 |
14 | 277a246d4c |
15 | 157126422a |
hex | c3747ba88 |
52467055240 has 64 divisors (see below), whose sum is σ = 127622635200. Its totient is φ = 19344883968.
The previous prime is 52467055237. The next prime is 52467055241. The reversal of 52467055240 is 4255076425.
52467055240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×524670552402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 52467055193 and 52467055202.
It is not an unprimeable number, because it can be changed into a prime (52467055241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 904794 + ... + 961033.
It is an arithmetic number, because the mean of its divisors is an integer number (1994103675).
Almost surely, 252467055240 is an apocalyptic number.
It is an amenable number.
52467055240 is an abundant number, since it is smaller than the sum of its proper divisors (75155579960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52467055240 is a wasteful number, since it uses less digits than its factorization.
52467055240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1865894 (or 1865890 counting only the distinct ones).
The product of its (nonzero) digits is 336000, while the sum is 40.
The spelling of 52467055240 in words is "fifty-two billion, four hundred sixty-seven million, fifty-five thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •