Base | Representation |
---|---|
bin | 11000011110001011… |
… | …11110000011001000 |
3 | 1020220121200220100020 |
4 | 30033011332003020 |
5 | 203401330000000 |
6 | 10011403340440 |
7 | 643401135300 |
oct | 141705760310 |
9 | 36817626306 |
10 | 13138125000 |
11 | 5632146850 |
12 | 2667b21720 |
13 | 1314ba3780 |
14 | 8c8c42600 |
15 | 51d637ba0 |
hex | 30f17e0c8 |
13138125000 has 768 divisors, whose sum is σ = 56109231360. Its totient is φ = 2520000000.
The previous prime is 13138124971. The next prime is 13138125017. The reversal of 13138125000 is 52183131.
It is a super-2 number, since 2×131381250002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1010624994 + ... + 1010625006.
It is an arithmetic number, because the mean of its divisors is an integer number (73058895).
Almost surely, 213138125000 is an apocalyptic number.
13138125000 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 13138125000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28054615680).
13138125000 is an abundant number, since it is smaller than the sum of its proper divisors (42971106360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13138125000 is an equidigital number, since it uses as much as digits as its factorization.
13138125000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
The spelling of 13138125000 in words is "thirteen billion, one hundred thirty-eight million, one hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •