Base | Representation |
---|---|
bin | 110010001110100111… |
… | …110101000001101011 |
3 | 12011012122100110012002 |
4 | 302032213311001223 |
5 | 1340423144204120 |
6 | 40435354441215 |
7 | 3616331642534 |
oct | 621647650153 |
9 | 164178313162 |
10 | 53932413035 |
11 | 20966494186 |
12 | a551a3320b |
13 | 5116689047 |
14 | 2878acd68b |
15 | 1609c19375 |
hex | c8e9f506b |
53932413035 has 4 divisors (see below), whose sum is σ = 64718895648. Its totient is φ = 43145930424.
The previous prime is 53932413019. The next prime is 53932413037. The reversal of 53932413035 is 53031423935.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 53932413035 - 24 = 53932413019 is a prime.
It is a super-2 number, since 2×539324130352 (a number of 22 digits) contains 22 as substring.
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 53932413035.
It is not an unprimeable number, because it can be changed into a prime (53932413037) 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 3 ways as a sum of consecutive naturals, for example, 5393241299 + ... + 5393241308.
It is an arithmetic number, because the mean of its divisors is an integer number (16179723912).
Almost surely, 253932413035 is an apocalyptic number.
53932413035 is a deficient number, since it is larger than the sum of its proper divisors (10786482613).
53932413035 is a wasteful number, since it uses less digits than its factorization.
53932413035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10786482612.
The product of its (nonzero) digits is 145800, while the sum is 38.
The spelling of 53932413035 in words is "fifty-three billion, nine hundred thirty-two million, four hundred thirteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •