Base | Representation |
---|---|
bin | 110001111110101101… |
… | …000110101000110010 |
3 | 12010112000211202220000 |
4 | 301332231012220302 |
5 | 1334401313013214 |
6 | 40353054530430 |
7 | 3606610015530 |
oct | 617655065062 |
9 | 163460752800 |
10 | 53665360434 |
11 | 20839773654 |
12 | a498506a16 |
13 | 50a325595a |
14 | 2851455150 |
15 | 15e1567809 |
hex | c7eb46a32 |
53665360434 has 80 divisors (see below), whose sum is σ = 140624899008. Its totient is φ = 14976366048.
The previous prime is 53665360433. The next prime is 53665360481. The reversal of 53665360434 is 43406356635.
53665360434 is a `hidden beast` number, since 5 + 3 + 6 + 6 + 5 + 3 + 604 + 34 = 666.
It is a super-2 number, since 2×536653604342 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53665360434.
It is not an unprimeable number, because it can be changed into a prime (53665360433) 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 39 ways as a sum of consecutive naturals, for example, 501517 + ... + 599040.
Almost surely, 253665360434 is an apocalyptic number.
53665360434 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
53665360434 is an abundant number, since it is smaller than the sum of its proper divisors (86959538574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53665360434 is a wasteful number, since it uses less digits than its factorization.
53665360434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100621 (or 1100612 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 45.
The spelling of 53665360434 in words is "fifty-three billion, six hundred sixty-five million, three hundred sixty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •