Base | Representation |
---|---|
bin | 100101010100111011111… |
… | …0100111010010011000000 |
3 | 200011102221112211222222202 |
4 | 1022221313310322103000 |
5 | 1133023123013413100 |
6 | 14524440522252332 |
7 | 1036434112432235 |
oct | 112516764722300 |
9 | 20142845758882 |
10 | 5130201310400 |
11 | 16a8784994121 |
12 | 6aa3260570a8 |
13 | 2b2a1189167a |
14 | 13a43589578c |
15 | 8d6ad09c7d5 |
hex | 4aa77d3a4c0 |
5130201310400 has 84 divisors (see below), whose sum is σ = 12635655358560. Its totient is φ = 2050104806400.
The previous prime is 5130201310363. The next prime is 5130201310433. The reversal of 5130201310400 is 40131020315.
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 11 ways as a sum of consecutive naturals, for example, 119390 + ... + 3205410.
Almost surely, 25130201310400 is an apocalyptic number.
5130201310400 is a gapful number since it is divisible by the number (50) 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 5130201310400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6317827679280).
5130201310400 is an abundant number, since it is smaller than the sum of its proper divisors (7505454048160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5130201310400 is a wasteful number, since it uses less digits than its factorization.
5130201310400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3087082 (or 3087067 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 5130201310400 its reverse (40131020315), we get a palindrome (5170332330715).
The spelling of 5130201310400 in words is "five trillion, one hundred thirty billion, two hundred one million, three hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •