Base | Representation |
---|---|
bin | 100100110100010010101… |
… | …1110000011100100001111 |
3 | 122220202000002002002002200 |
4 | 1021220211132003210033 |
5 | 1130401041112014412 |
6 | 14432324454252543 |
7 | 1031402666162403 |
oct | 111504536034417 |
9 | 18822002062080 |
10 | 5060100110607 |
11 | 1680a81661163 |
12 | 698821357153 |
13 | 2a921c4a33a9 |
14 | 136ca5659103 |
15 | 8b958b4b9dc |
hex | 49a2578390f |
5060100110607 has 48 divisors (see below), whose sum is σ = 7878830069760. Its totient is φ = 3119331249216.
The previous prime is 5060100110521. The next prime is 5060100110621. The reversal of 5060100110607 is 7060110010605.
5060100110607 is a `hidden beast` number, since 50 + 6 + 0 + 1 + 0 + 0 + 1 + 1 + 0 + 607 = 666.
It is not a de Polignac number, because 5060100110607 - 224 = 5060083333391 is a prime.
It is a super-2 number, since 2×50601001106072 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5060100110627) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2091813 + ... + 3807345.
It is an arithmetic number, because the mean of its divisors is an integer number (164142293120).
Almost surely, 25060100110607 is an apocalyptic number.
5060100110607 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
5060100110607 is a deficient number, since it is larger than the sum of its proper divisors (2818729959153).
5060100110607 is a wasteful number, since it uses less digits than its factorization.
5060100110607 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1715972 (or 1715969 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The spelling of 5060100110607 in words is "five trillion, sixty billion, one hundred million, one hundred ten thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •