Base | Representation |
---|---|
bin | 11001101011000110010000… |
… | …10110011100011011111001 |
3 | 21101220011212101101112211122 |
4 | 30311203020112130123321 |
5 | 24344440212313343330 |
6 | 320023414542035025 |
7 | 14614561335401234 |
oct | 1465431026343371 |
9 | 241804771345748 |
10 | 56456411465465 |
11 | 16a97036502880 |
12 | 63b9769b78a75 |
13 | 2566a80553a6b |
14 | dd270d60641b |
15 | 67d862b995e5 |
hex | 3358c859c6f9 |
56456411465465 has 16 divisors (see below), whose sum is σ = 77119904359296. Its totient is φ = 39274025366400.
The previous prime is 56456411465429. The next prime is 56456411465507.
It is a happy number.
56456411465465 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56456411465465 - 228 = 56456143030009 is a prime.
It is a super-3 number, since 3×564564114654653 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56456411465398 and 56456411465407.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22314785876 + ... + 22314788405.
It is an arithmetic number, because the mean of its divisors is an integer number (4819994022456).
Almost surely, 256456411465465 is an apocalyptic number.
56456411465465 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56456411465465 is a deficient number, since it is larger than the sum of its proper divisors (20663492893831).
56456411465465 is a wasteful number, since it uses less digits than its factorization.
56456411465465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44629574320.
The product of its digits is 207360000, while the sum is 62.
The spelling of 56456411465465 in words is "fifty-six trillion, four hundred fifty-six billion, four hundred eleven million, four hundred sixty-five thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •