Base | Representation |
---|---|
bin | 11000010010001111110100… |
… | …01101110011010010010011 |
3 | 21000002022211120101011202221 |
4 | 30021013322031303102103 |
5 | 23444430410214004412 |
6 | 305325124042121511 |
7 | 14151164110640365 |
oct | 1411077215632223 |
9 | 230068746334687 |
10 | 53403526313107 |
11 | 1601a343416413 |
12 | 5ba5b64ab0297 |
13 | 23a4c143115c9 |
14 | d28a5cb50d35 |
15 | 629235655b07 |
hex | 3091fa373493 |
53403526313107 has 32 divisors (see below), whose sum is σ = 59826723393024. Its totient is φ = 47427318374400.
The previous prime is 53403526313089. The next prime is 53403526313119. The reversal of 53403526313107 is 70131362530435.
It is a happy number.
53403526313107 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 53403526313107 - 27 = 53403526312979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53403526313167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37172113 + ... + 38582029.
It is an arithmetic number, because the mean of its divisors is an integer number (1869585106032).
Almost surely, 253403526313107 is an apocalyptic number.
53403526313107 is a deficient number, since it is larger than the sum of its proper divisors (6423197079917).
53403526313107 is a wasteful number, since it uses less digits than its factorization.
53403526313107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411759.
The product of its (nonzero) digits is 680400, while the sum is 43.
The spelling of 53403526313107 in words is "fifty-three trillion, four hundred three billion, five hundred twenty-six million, three hundred thirteen thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •