Base | Representation |
---|---|
bin | 110111111110100111… |
… | …110101011001000100 |
3 | 12202010220212000021211 |
4 | 313332213311121010 |
5 | 1441044221230040 |
6 | 43340145221204 |
7 | 4225331140210 |
oct | 677647653104 |
9 | 182126760254 |
10 | 60106430020 |
11 | 2354457055a |
12 | b795631804 |
13 | 588b812630 |
14 | 2ca2a79940 |
15 | 186bc778ea |
hex | dfe9f5644 |
60106430020 has 96 divisors (see below), whose sum is σ = 155477887488. Its totient is φ = 19007281152.
The previous prime is 60106429987. The next prime is 60106430057. The reversal of 60106430020 is 2003460106.
It is a super-2 number, since 2×601064300202 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 60106429973 and 60106430000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2347809 + ... + 2373271.
It is an arithmetic number, because the mean of its divisors is an integer number (1619561328).
Almost surely, 260106430020 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 60106430020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77738943744).
60106430020 is an abundant number, since it is smaller than the sum of its proper divisors (95371457468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60106430020 is a wasteful number, since it uses less digits than its factorization.
60106430020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26789 (or 26787 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 60106430020 its reverse (2003460106), we get a palindrome (62109890126).
The spelling of 60106430020 in words is "sixty billion, one hundred six million, four hundred thirty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •