Base | Representation |
---|---|
bin | 100101001000110011100… |
… | …0100000000011100100100 |
3 | 200001221201000012002011000 |
4 | 1022101213010000130210 |
5 | 1132111244431020200 |
6 | 14504451513513300 |
7 | 1034522413201512 |
oct | 112214704003444 |
9 | 20057630162130 |
10 | 5104150251300 |
11 | 169872682a911 |
12 | 6a5275712830 |
13 | 2b041c6817b9 |
14 | 139083aad4b2 |
15 | 8cb85eb0300 |
hex | 4a467100724 |
5104150251300 has 72 divisors (see below), whose sum is σ = 16408897853600. Its totient is φ = 1361106732960.
The previous prime is 5104150251281. The next prime is 5104150251301. The reversal of 5104150251300 is 31520514015.
5104150251300 is a `hidden beast` number, since 5 + 104 + 1 + 5 + 0 + 251 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5104150251301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 945210310 + ... + 945215709.
Almost surely, 25104150251300 is an apocalyptic number.
5104150251300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5104150251300 is an abundant number, since it is smaller than the sum of its proper divisors (11304747602300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5104150251300 is a wasteful number, since it uses less digits than its factorization.
5104150251300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1890426042 (or 1890426029 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 5104150251300 its reverse (31520514015), we get a palindrome (5135670765315).
The spelling of 5104150251300 in words is "five trillion, one hundred four billion, one hundred fifty million, two hundred fifty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •