Base | Representation |
---|---|
bin | 101111111110100100… |
… | …1000010000111001000 |
3 | 100211221102110212110002 |
4 | 1133331021002013020 |
5 | 3142002000021100 |
6 | 115155405142132 |
7 | 10305132121100 |
oct | 1377511020710 |
9 | 324842425402 |
10 | 103031251400 |
11 | 3a771501150 |
12 | 17b74b5a948 |
13 | 993c81671c |
14 | 4db5880200 |
15 | 2a304032d5 |
hex | 17fd2421c8 |
103031251400 has 288 divisors, whose sum is σ = 307032223680. Its totient is φ = 31792320000.
The previous prime is 103031251397. The next prime is 103031251447. The reversal of 103031251400 is 4152130301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 10883069 + ... + 10892531.
It is an arithmetic number, because the mean of its divisors is an integer number (1066084110).
Almost surely, 2103031251400 is an apocalyptic number.
103031251400 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 103031251400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153516111840).
103031251400 is an abundant number, since it is smaller than the sum of its proper divisors (204000972280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103031251400 is a wasteful number, since it uses less digits than its factorization.
103031251400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9605 (or 9589 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 103031251400 its reverse (4152130301), we get a palindrome (107183381701).
The spelling of 103031251400 in words is "one hundred three billion, thirty-one million, two hundred fifty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •