Base | Representation |
---|---|
bin | 11001110010111101010000… |
… | …01110100010101101101101 |
3 | 21102211222220012210222011021 |
4 | 30321132220032202231231 |
5 | 24413401240044302030 |
6 | 320351435054054141 |
7 | 14643231306452014 |
oct | 1471365016425555 |
9 | 242758805728137 |
10 | 56726455462765 |
11 | 17090611286950 |
12 | 6441b731aa351 |
13 | 258638815368a |
14 | 100180a0b3a7b |
15 | 6858ba52097a |
hex | 3397a83a2b6d |
56726455462765 has 32 divisors (see below), whose sum is σ = 74808553881600. Its totient is φ = 40951013113920.
The previous prime is 56726455462739. The next prime is 56726455462783.
56726455462765 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56726455462765 - 213 = 56726455454573 is a prime.
It is a super-2 number, since 2×567264554627652 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56726455462694 and 56726455462703.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39655164 + ... + 41060746.
It is an arithmetic number, because the mean of its divisors is an integer number (2337767308800).
Almost surely, 256726455462765 is an apocalyptic number.
56726455462765 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56726455462765 is a deficient number, since it is larger than the sum of its proper divisors (18082098418835).
56726455462765 is a wasteful number, since it uses less digits than its factorization.
56726455462765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411017.
The product of its digits is 2540160000, while the sum is 70.
The spelling of 56726455462765 in words is "fifty-six trillion, seven hundred twenty-six billion, four hundred fifty-five million, four hundred sixty-two thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •