Base | Representation |
---|---|
bin | 11000101111001110… |
… | …00111010011101000 |
3 | 1021021120121022001212 |
4 | 30113213013103220 |
5 | 204144421001100 |
6 | 10033510332252 |
7 | 650054622110 |
oct | 142747072350 |
9 | 37246538055 |
10 | 13281031400 |
11 | 56a588350a |
12 | 26a795a088 |
13 | 133868a980 |
14 | 8ddc02040 |
15 | 52ae65635 |
hex | 3179c74e8 |
13281031400 has 192 divisors, whose sum is σ = 39316233600. Its totient is φ = 4058127360.
The previous prime is 13281031373. The next prime is 13281031403. The reversal of 13281031400 is 413018231.
It is not an unprimeable number, because it can be changed into a prime (13281031403) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 515219 + ... + 540381.
It is an arithmetic number, because the mean of its divisors is an integer number (204772050).
Almost surely, 213281031400 is an apocalyptic number.
13281031400 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 13281031400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19658116800).
13281031400 is an abundant number, since it is smaller than the sum of its proper divisors (26035202200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13281031400 is a wasteful number, since it uses less digits than its factorization.
13281031400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25228 (or 25219 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13281031400 its reverse (413018231), we get a palindrome (13694049631).
The spelling of 13281031400 in words is "thirteen billion, two hundred eighty-one million, thirty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •