Base | Representation |
---|---|
bin | 100101010100111001000… |
… | …0101100010010010011110 |
3 | 200011102200211122012010000 |
4 | 1022221302011202102132 |
5 | 1133022423340131324 |
6 | 14524423202155130 |
7 | 1036431533026140 |
oct | 112516205422236 |
9 | 20142624565100 |
10 | 5130105005214 |
11 | 16a8735596662 |
12 | 6aa2b9952aa6 |
13 | 2b29c7942857 |
14 | 13a426b86c90 |
15 | 8d6a48c79c9 |
hex | 4aa7216249e |
5130105005214 has 40 divisors (see below), whose sum is σ = 13137411762288. Its totient is φ = 1465744286880.
The previous prime is 5130105005177. The next prime is 5130105005269. The reversal of 5130105005214 is 4125005010315.
5130105005214 is a `hidden beast` number, since 5 + 1 + 30 + 105 + 0 + 0 + 521 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2261949927 + ... + 2261952194.
Almost surely, 25130105005214 is an apocalyptic number.
5130105005214 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
5130105005214 is an abundant number, since it is smaller than the sum of its proper divisors (8007306757074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5130105005214 is a wasteful number, since it uses less digits than its factorization.
5130105005214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4523902142 (or 4523902133 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The spelling of 5130105005214 in words is "five trillion, one hundred thirty billion, one hundred five million, five thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •