Base | Representation |
---|---|
bin | 100101010010101011001… |
… | …0111111110100001011001 |
3 | 200010222102010001110112120 |
4 | 1022211112113332201121 |
5 | 1132433201322010410 |
6 | 14522315005131453 |
7 | 1036202554422003 |
oct | 112452627764131 |
9 | 20128363043476 |
10 | 5125345110105 |
11 | 16a6712773a50 |
12 | 6a93ab859b89 |
13 | 2b241977077c |
14 | 13a0d4947373 |
15 | 8d4c6a9d570 |
hex | 4a9565fe859 |
5125345110105 has 32 divisors (see below), whose sum is σ = 9416902026240. Its totient is φ = 2354225503680.
The previous prime is 5125345110071. The next prime is 5125345110113. The reversal of 5125345110105 is 5010115435215.
It is a happy number.
It is not a de Polignac number, because 5125345110105 - 27 = 5125345109977 is a prime.
It is a super-2 number, since 2×51253451101052 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
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, 817436277 + ... + 817442546.
It is an arithmetic number, because the mean of its divisors is an integer number (294278188320).
Almost surely, 25125345110105 is an apocalyptic number.
5125345110105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5125345110105 is a deficient number, since it is larger than the sum of its proper divisors (4291556916135).
5125345110105 is a wasteful number, since it uses less digits than its factorization.
5125345110105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634878861.
The product of its (nonzero) digits is 15000, while the sum is 33.
The spelling of 5125345110105 in words is "five trillion, one hundred twenty-five billion, three hundred forty-five million, one hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •