Base | Representation |
---|---|
bin | 110010001110110011… |
… | …010110101111010000 |
3 | 12011012212000222010202 |
4 | 302032303112233100 |
5 | 1340424432402304 |
6 | 40435543314332 |
7 | 3616366426214 |
oct | 621663265720 |
9 | 164185028122 |
10 | 53935434704 |
11 | 20968168428 |
12 | a552a4b9a8 |
13 | 51171a6508 |
14 | 2879278944 |
15 | 160a11481e |
hex | c8ecd6bd0 |
53935434704 has 20 divisors (see below), whose sum is σ = 108103350660. Its totient is φ = 26037795840.
The previous prime is 53935434701. The next prime is 53935434737. The reversal of 53935434704 is 40743453935.
It can be written as a sum of positive squares in 2 ways, for example, as 13192819600 + 40742615104 = 114860^2 + 201848^2 .
It is a super-2 number, since 2×539354347042 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53935434701) 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, 58119617 + ... + 58120544.
It is an arithmetic number, because the mean of its divisors is an integer number (5405167533).
Almost surely, 253935434704 is an apocalyptic number.
It is an amenable number.
53935434704 is an abundant number, since it is smaller than the sum of its proper divisors (54167915956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53935434704 is a wasteful number, since it uses less digits than its factorization.
53935434704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116240198 (or 116240192 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 47.
The spelling of 53935434704 in words is "fifty-three billion, nine hundred thirty-five million, four hundred thirty-four thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •