Base | Representation |
---|---|
bin | 11001000010100100… |
… | …00000000000000000 |
3 | 1021200212212210200100 |
4 | 30201102000000000 |
5 | 210012434043413 |
6 | 10101543522400 |
7 | 654064616640 |
oct | 144122000000 |
9 | 37625783610 |
10 | 13443268608 |
11 | 5779413750 |
12 | 2732159400 |
13 | 1363182813 |
14 | 917594520 |
15 | 53a310a73 |
hex | 321480000 |
13443268608 has 480 divisors, whose sum is σ = 49727620800. Its totient is φ = 3397386240.
The previous prime is 13443268549. The next prime is 13443268609. The reversal of 13443268608 is 80686234431.
13443268608 is a `hidden beast` number, since 1 + 3 + 4 + 4 + 32 + 6 + 8 + 608 = 666.
It is not an unprimeable number, because it can be changed into a prime (13443268609) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 363331566 + ... + 363331602.
It is an arithmetic number, because the mean of its divisors is an integer number (103599210).
Almost surely, 213443268608 is an apocalyptic number.
13443268608 is a gapful number since it is divisible by the number (18) 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 13443268608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24863810400).
13443268608 is an abundant number, since it is smaller than the sum of its proper divisors (36284352192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13443268608 is an frugal number, since it uses more digits than its factorization.
13443268608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 45.
The spelling of 13443268608 in words is "thirteen billion, four hundred forty-three million, two hundred sixty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •