Base | Representation |
---|---|
bin | 11001011100100100… |
… | …00110110100101000 |
3 | 1022021002100001012010 |
4 | 30232102012310220 |
5 | 210434304302420 |
6 | 10135335115520 |
7 | 662353662366 |
oct | 145622066450 |
9 | 38232301163 |
10 | 13661400360 |
11 | 5880560323 |
12 | 2793212ba0 |
13 | 1399417a6a |
14 | 938536636 |
15 | 54e54c4e0 |
hex | 32e486d28 |
13661400360 has 128 divisors (see below), whose sum is σ = 41264121600. Its totient is φ = 3618263040.
The previous prime is 13661400343. The next prime is 13661400391. The reversal of 13661400360 is 6300416631.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14517490 + ... + 14518430.
It is an arithmetic number, because the mean of its divisors is an integer number (322375950).
Almost surely, 213661400360 is an apocalyptic number.
13661400360 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 13661400360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20632060800).
13661400360 is an abundant number, since it is smaller than the sum of its proper divisors (27602721240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13661400360 is a wasteful number, since it uses less digits than its factorization.
13661400360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1651 (or 1647 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 13661400360 its reverse (6300416631), we get a palindrome (19961816991).
The spelling of 13661400360 in words is "thirteen billion, six hundred sixty-one million, four hundred thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •