Base | Representation |
---|---|
bin | 11000101101000110… |
… | …01011111101010000 |
3 | 1021020100002121210211 |
4 | 30112203023331100 |
5 | 204130341142111 |
6 | 10032032533504 |
7 | 646450356313 |
oct | 142643137520 |
9 | 37210077724 |
10 | 13263224656 |
11 | 5696820aa0 |
12 | 26a19b1294 |
13 | 1334a94936 |
14 | 8db6c897a |
15 | 5295e9521 |
hex | 3168cbf50 |
13263224656 has 80 divisors (see below), whose sum is σ = 28428859008. Its totient is φ = 5944256000.
The previous prime is 13263224591. The next prime is 13263224671. The reversal of 13263224656 is 65642236231.
13263224656 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4673670 + ... + 4676506.
Almost surely, 213263224656 is an apocalyptic number.
13263224656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13263224656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14214429504).
13263224656 is an abundant number, since it is smaller than the sum of its proper divisors (15165634352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13263224656 is a wasteful number, since it uses less digits than its factorization.
13263224656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3220 (or 3214 counting only the distinct ones).
The product of its digits is 311040, while the sum is 40.
The spelling of 13263224656 in words is "thirteen billion, two hundred sixty-three million, two hundred twenty-four thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •