Base | Representation |
---|---|
bin | 110111111001011110… |
… | …101110100010001100 |
3 | 12201220220111212100100 |
4 | 313321132232202030 |
5 | 1440410130002211 |
6 | 43323424131100 |
7 | 4223232625113 |
oct | 677136564214 |
9 | 181826455310 |
10 | 60020156556 |
11 | 234aa8a4a78 |
12 | b770766a90 |
13 | 5876996949 |
14 | 2c9541cc7a |
15 | 18643d5156 |
hex | df97ae88c |
60020156556 has 36 divisors (see below), whose sum is σ = 152008870104. Its totient is φ = 19968312000.
The previous prime is 60020156519. The next prime is 60020156557. The reversal of 60020156556 is 65565102006.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×600201565562 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 60020156556.
It is not an unprimeable number, because it can be changed into a prime (60020156557) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1581270 + ... + 1618781.
It is an arithmetic number, because the mean of its divisors is an integer number (4222468614).
Almost surely, 260020156556 is an apocalyptic number.
It is an amenable number.
60020156556 is an abundant number, since it is smaller than the sum of its proper divisors (91988713548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60020156556 is a wasteful number, since it uses less digits than its factorization.
60020156556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3200582 (or 3200577 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 60020156556 in words is "sixty billion, twenty million, one hundred fifty-six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •