Base | Representation |
---|---|
bin | 11001100101011100111010… |
… | …00011000001100111011001 |
3 | 21101012122010012002110020121 |
4 | 30302232131003001213121 |
5 | 24333300404311120030 |
6 | 315354332303553241 |
7 | 14564553001310302 |
oct | 1462563503014731 |
9 | 241178105073217 |
10 | 56262411426265 |
11 | 16a21833545a70 |
12 | 63880478bb821 |
13 | 25516a42b8865 |
14 | dc71883237a9 |
15 | 6787ab35147a |
hex | 332b9d0c19d9 |
56262411426265 has 32 divisors (see below), whose sum is σ = 73737389166336. Its totient is φ = 40871029800960.
The previous prime is 56262411426187. The next prime is 56262411426281.
56262411426265 is nontrivially palindromic in base 10.
56262411426265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-56262411426265 is a prime.
It is a Duffinian 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 31 ways as a sum of consecutive naturals, for example, 429048349 + ... + 429179461.
It is an arithmetic number, because the mean of its divisors is an integer number (2304293411448).
Almost surely, 256262411426265 is an apocalyptic number.
56262411426265 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56262411426265 is a deficient number, since it is larger than the sum of its proper divisors (17474977740071).
56262411426265 is a wasteful number, since it uses less digits than its factorization.
56262411426265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140049.
The product of its digits is 8294400, while the sum is 52.
The spelling of 56262411426265 in words is "fifty-six trillion, two hundred sixty-two billion, four hundred eleven million, four hundred twenty-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •