Base | Representation |
---|---|
bin | 110100110110110001… |
… | …000001010011100011 |
3 | 12102111020112011211110 |
4 | 310312301001103203 |
5 | 1412212332114130 |
6 | 42023330114403 |
7 | 4046254616520 |
oct | 646661012343 |
9 | 172436464743 |
10 | 56753394915 |
11 | 220838a2668 |
12 | abba71ba03 |
13 | 5475c515a9 |
14 | 2a65616147 |
15 | 17226eaab0 |
hex | d36c414e3 |
56753394915 has 64 divisors (see below), whose sum is σ = 115665546240. Its totient is φ = 23133081600.
The previous prime is 56753394911. The next prime is 56753394917. The reversal of 56753394915 is 51949335765.
It is not a de Polignac number, because 56753394915 - 22 = 56753394911 is a prime.
It is a super-3 number, since 3×567533949153 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (56753394911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 802786 + ... + 870615.
It is an arithmetic number, because the mean of its divisors is an integer number (1807274160).
Almost surely, 256753394915 is an apocalyptic number.
56753394915 is an abundant number, since it is smaller than the sum of its proper divisors (58912151325).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56753394915 is a wasteful number, since it uses less digits than its factorization.
56753394915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1673452.
The product of its digits is 15309000, while the sum is 57.
The spelling of 56753394915 in words is "fifty-six billion, seven hundred fifty-three million, three hundred ninety-four thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •