Base | Representation |
---|---|
bin | 110111111110100110… |
… | …001110111111101001 |
3 | 12202010220001200221210 |
4 | 313332212032333221 |
5 | 1441044114314401 |
6 | 43340132223333 |
7 | 4225324442340 |
oct | 677646167751 |
9 | 182126050853 |
10 | 60106010601 |
11 | 2354430442a |
12 | b79546ab49 |
13 | 588b6c6760 |
14 | 2ca29aab57 |
15 | 186bbe34d6 |
hex | dfe98efe9 |
60106010601 has 64 divisors (see below), whose sum is σ = 101480132096. Its totient is φ = 30792960000.
The previous prime is 60106010507. The next prime is 60106010609. The reversal of 60106010601 is 10601060106.
It is not a de Polignac number, because 60106010601 - 27 = 60106010473 is a prime.
It is a super-3 number, since 3×601060106013 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
60106010601 is a modest number, since divided by 6010601 gives 601 as remainder.
It is not an unprimeable number, because it can be changed into a prime (60106010609) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6065751 + ... + 6075651.
It is an arithmetic number, because the mean of its divisors is an integer number (1585627064).
Almost surely, 260106010601 is an apocalyptic number.
It is an amenable number.
60106010601 is a deficient number, since it is larger than the sum of its proper divisors (41374121495).
60106010601 is a wasteful number, since it uses less digits than its factorization.
60106010601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10562.
The product of its (nonzero) digits is 216, while the sum is 21.
Multiplying 60106010601 by its sum of digits (21), we get a palindrome (1262226222621).
Adding to 60106010601 its reverse (10601060106), we get a palindrome (70707070707).
The spelling of 60106010601 in words is "sixty billion, one hundred six million, ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •