Base | Representation |
---|---|
bin | 110001000100010001… |
… | …001101110110111101 |
3 | 12000222201001212001000 |
4 | 301010101031312331 |
5 | 1330344323041303 |
6 | 40111513440513 |
7 | 3543403603602 |
oct | 610421156675 |
9 | 160881055030 |
10 | 52684971453 |
11 | 20386324924 |
12 | a264110139 |
13 | 4c780c3b2a |
14 | 279b1706a9 |
15 | 158545bda3 |
hex | c4444ddbd |
52684971453 has 16 divisors (see below), whose sum is σ = 78136777600. Its totient is φ = 35085078720.
The previous prime is 52684971359. The next prime is 52684971461. The reversal of 52684971453 is 35417948625.
It is a happy number.
52684971453 is a `hidden beast` number, since 5 + 2 + 6 + 8 + 497 + 145 + 3 = 666.
52684971453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52684971453 - 230 = 51611229629 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52684971453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52684971463) 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, 1036828 + ... + 1086453.
It is an arithmetic number, because the mean of its divisors is an integer number (4883548600).
Almost surely, 252684971453 is an apocalyptic number.
It is an amenable number.
52684971453 is a deficient number, since it is larger than the sum of its proper divisors (25451806147).
52684971453 is a wasteful number, since it uses less digits than its factorization.
52684971453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2124209 (or 2124203 counting only the distinct ones).
The product of its digits is 7257600, while the sum is 54.
The spelling of 52684971453 in words is "fifty-two billion, six hundred eighty-four million, nine hundred seventy-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •