Base | Representation |
---|---|
bin | 100100110010011000110… |
… | …1101110100000010100110 |
3 | 122220100110001221110000121 |
4 | 1021210301231310002212 |
5 | 1130314202203204424 |
6 | 14430411010032154 |
7 | 1031166441003631 |
oct | 111446155640246 |
9 | 18810401843017 |
10 | 5056010600614 |
11 | 167a2731a0836 |
12 | 697a7b87865a |
13 | 2a8a1a171aac |
14 | 1369d8484c18 |
15 | 8b7b9ae4ee4 |
hex | 49931b740a6 |
5056010600614 has 32 divisors (see below), whose sum is σ = 7623543370752. Its totient is φ = 2514869448000.
The previous prime is 5056010600611. The next prime is 5056010600617. The reversal of 5056010600614 is 4160060106505.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5056010600611) and next prime (5056010600617).
It is a super-2 number, since 2×50560106006142 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5056010600614.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5056010600611) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1151446359 + ... + 1151450749.
It is an arithmetic number, because the mean of its divisors is an integer number (238235730336).
Almost surely, 25056010600614 is an apocalyptic number.
5056010600614 is a deficient number, since it is larger than the sum of its proper divisors (2567532770138).
5056010600614 is a wasteful number, since it uses less digits than its factorization.
5056010600614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8292.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 5056010600614 in words is "five trillion, fifty-six billion, ten million, six hundred thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •