Base | Representation |
---|---|
bin | 100101010111010111101… |
… | …1111010000011000111000 |
3 | 200011221102221210022022220 |
4 | 1022232233133100120320 |
5 | 1133114330103000422 |
6 | 14531103430044040 |
7 | 1040010513555060 |
oct | 112565737203070 |
9 | 20157387708286 |
10 | 5135430125112 |
11 | 16aaa18474aa1 |
12 | 6ab3451a9620 |
13 | 2b3365c55b81 |
14 | 13a7b00ba3a0 |
15 | 8d8b7150e5c |
hex | 4abaf7d0638 |
5135430125112 has 128 divisors (see below), whose sum is σ = 14817525964800. Its totient is φ = 1452783558528.
The previous prime is 5135430125087. The next prime is 5135430125129. The reversal of 5135430125112 is 2115210345315.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 124689339 + ... + 124730517.
It is an arithmetic number, because the mean of its divisors is an integer number (115761921600).
Almost surely, 25135430125112 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 5135430125112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7408762982400).
5135430125112 is an abundant number, since it is smaller than the sum of its proper divisors (9682095839688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5135430125112 is a wasteful number, since it uses less digits than its factorization.
5135430125112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48505 (or 48501 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 33.
The spelling of 5135430125112 in words is "five trillion, one hundred thirty-five billion, four hundred thirty million, one hundred twenty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •