Base | Representation |
---|---|
bin | 11001110010011000010001… |
… | …11001010101000101110111 |
3 | 21102210002122121212200220202 |
4 | 30321030020321111011313 |
5 | 24413040110212033130 |
6 | 320334353055151115 |
7 | 14641626320621063 |
oct | 1471141071250567 |
9 | 242702577780822 |
10 | 56706602455415 |
11 | 17083153825660 |
12 | 643a15251549b |
13 | 2584543063b53 |
14 | 1000885532aa3 |
15 | 68510763d145 |
hex | 339308e55177 |
56706602455415 has 16 divisors (see below), whose sum is σ = 74678613327360. Its totient is φ = 40994212329120.
The previous prime is 56706602455379. The next prime is 56706602455421. The reversal of 56706602455415 is 51455420660765.
56706602455415 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56706602455415 - 214 = 56706602439031 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3086904395 + ... + 3086922764.
It is an arithmetic number, because the mean of its divisors is an integer number (4667413332960).
Almost surely, 256706602455415 is an apocalyptic number.
56706602455415 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
56706602455415 is a deficient number, since it is larger than the sum of its proper divisors (17972010871945).
56706602455415 is a wasteful number, since it uses less digits than its factorization.
56706602455415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6173827342.
The product of its (nonzero) digits is 30240000, while the sum is 56.
The spelling of 56706602455415 in words is "fifty-six trillion, seven hundred six billion, six hundred two million, four hundred fifty-five thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •