Base | Representation |
---|---|
bin | 100101001001111010100… |
… | …1011011001010111011010 |
3 | 200002011212011200011021020 |
4 | 1022103311023121113122 |
5 | 1132131140321144200 |
6 | 14505524245423310 |
7 | 1034635454343540 |
oct | 112236513312732 |
9 | 20064764604236 |
10 | 5106534553050 |
11 | 169973a6a0027 |
12 | 6a582010ab36 |
13 | 2b070c632038 |
14 | 13922c603d90 |
15 | 8cc75484ea0 |
hex | 4a4f52d95da |
5106534553050 has 96 divisors (see below), whose sum is σ = 14616679008384. Its totient is φ = 1155651360000.
The previous prime is 5106534553039. The next prime is 5106534553117. The reversal of 5106534553050 is 503554356015.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 5106534552993 and 5106534553011.
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 47 ways as a sum of consecutive naturals, for example, 23970021 + ... + 24182120.
It is an arithmetic number, because the mean of its divisors is an integer number (152257073004).
Almost surely, 25106534553050 is an apocalyptic number.
5106534553050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5106534553050 is an abundant number, since it is smaller than the sum of its proper divisors (9510144455334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106534553050 is a wasteful number, since it uses less digits than its factorization.
5106534553050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48152264 (or 48152259 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 42.
The spelling of 5106534553050 in words is "five trillion, one hundred six billion, five hundred thirty-four million, five hundred fifty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •