Base | Representation |
---|---|
bin | 11000101101001100… |
… | …00000100110010000 |
3 | 1021020101111012202200 |
4 | 30112212000212100 |
5 | 204131033331220 |
6 | 10032100443200 |
7 | 646456560420 |
oct | 142646004620 |
9 | 37211435680 |
10 | 13263964560 |
11 | 5697186990 |
12 | 26a20a9500 |
13 | 1334c93652 |
14 | 8db83c480 |
15 | 5296e3890 |
hex | 316980990 |
13263964560 has 480 divisors, whose sum is σ = 55766430720. Its totient is φ = 2744755200.
The previous prime is 13263964547. The next prime is 13263964579. The reversal of 13263964560 is 6546936231.
13263964560 is a `hidden beast` number, since 1 + 3 + 2 + 639 + 6 + 4 + 5 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23229075 + ... + 23229645.
It is an arithmetic number, because the mean of its divisors is an integer number (116180064).
Almost surely, 213263964560 is an apocalyptic number.
13263964560 is a gapful number since it is divisible by the number (10) 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 13263964560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27883215360).
13263964560 is an abundant number, since it is smaller than the sum of its proper divisors (42502466160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13263964560 is a wasteful number, since it uses less digits than its factorization.
13263964560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1027 (or 1018 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 13263964560 in words is "thirteen billion, two hundred sixty-three million, nine hundred sixty-four thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •