Base | Representation |
---|---|
bin | 110001011010101000… |
… | …001110000100101001 |
3 | 12001221211221101012110 |
4 | 301122220032010221 |
5 | 1332131341203033 |
6 | 40213034032533 |
7 | 3555610261146 |
oct | 613250160451 |
9 | 161854841173 |
10 | 53060100393 |
11 | 20559052843 |
12 | a349878749 |
13 | 5007a37b11 |
14 | 27d4cdd3cd |
15 | 15a835b363 |
hex | c5aa0e129 |
53060100393 has 16 divisors (see below), whose sum is σ = 71025352640. Its totient is φ = 35234208576.
The previous prime is 53060100391. The next prime is 53060100413. The reversal of 53060100393 is 39300106035.
It is not a de Polignac number, because 53060100393 - 21 = 53060100391 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 53060100393.
It is not an unprimeable number, because it can be changed into a prime (53060100391) 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, 3098571 + ... + 3115647.
It is an arithmetic number, because the mean of its divisors is an integer number (4439084540).
Almost surely, 253060100393 is an apocalyptic number.
It is an amenable number.
53060100393 is a deficient number, since it is larger than the sum of its proper divisors (17965252247).
53060100393 is a wasteful number, since it uses less digits than its factorization.
53060100393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21096.
The product of its (nonzero) digits is 7290, while the sum is 30.
The spelling of 53060100393 in words is "fifty-three billion, sixty million, one hundred thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •