Base | Representation |
---|---|
bin | 100101010100110111110… |
… | …0110000101011010011000 |
3 | 200011102120220222120102110 |
4 | 1022221233212011122120 |
5 | 1133022332140043130 |
6 | 14524415110232320 |
7 | 1036430514525513 |
oct | 112515746053230 |
9 | 20142526876373 |
10 | 5130063206040 |
11 | 16a8713a37293 |
12 | 6aa2a79556a0 |
13 | 2b29bc099106 |
14 | 13a4213c5d7a |
15 | 8d6a0dbcab0 |
hex | 4aa6f985698 |
5130063206040 has 128 divisors (see below), whose sum is σ = 15818420664000. Its totient is φ = 1330009325568.
The previous prime is 5130063205963. The next prime is 5130063206069. The reversal of 5130063206040 is 406023600315.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5130063205989 and 5130063206007.
It is a congruent number.
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, 5274976 + ... + 6171344.
Almost surely, 25130063206040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5130063206040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7909210332000).
5130063206040 is an abundant number, since it is smaller than the sum of its proper divisors (10688357457960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5130063206040 is a wasteful number, since it uses less digits than its factorization.
5130063206040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897709 (or 897705 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 5130063206040 its reverse (406023600315), we get a palindrome (5536086806355).
The spelling of 5130063206040 in words is "five trillion, one hundred thirty billion, sixty-three million, two hundred six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •