Base | Representation |
---|---|
bin | 111000011100011001… |
… | …110000011001000001 |
3 | 12210102201222122021210 |
4 | 320130121300121001 |
5 | 1443110122243001 |
6 | 43501514040333 |
7 | 4243605655551 |
oct | 703431603101 |
9 | 183381878253 |
10 | 60606056001 |
11 | 237805a1997 |
12 | b8b4a190a9 |
13 | 593b1963ca |
14 | 2d0d175161 |
15 | 189aa69dd6 |
hex | e1c670641 |
60606056001 has 8 divisors (see below), whose sum is σ = 80874478944. Its totient is φ = 40370835200.
The previous prime is 60606055987. The next prime is 60606056047. The reversal of 60606056001 is 10065060606.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 60606056001 - 214 = 60606039617 is a prime.
It is a super-3 number, since 3×606060560013 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 60606056001.
It is not an unprimeable number, because it can be changed into a prime (60606056081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8296275 + ... + 8303576.
It is an arithmetic number, because the mean of its divisors is an integer number (10109309868).
Almost surely, 260606056001 is an apocalyptic number.
It is an amenable number.
60606056001 is a deficient number, since it is larger than the sum of its proper divisors (20268422943).
60606056001 is a wasteful number, since it uses less digits than its factorization.
60606056001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16601071.
The product of its (nonzero) digits is 6480, while the sum is 30.
It can be divided in two parts, 6060605 and 6001, that added together give a palindrome (6066606).
The spelling of 60606056001 in words is "sixty billion, six hundred six million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •