Base | Representation |
---|---|
bin | 111000110010000110… |
… | …001010110011011100 |
3 | 12211101002211221010010 |
4 | 320302012022303130 |
5 | 1444331311120220 |
6 | 44001555043220 |
7 | 4255615422345 |
oct | 706206126334 |
9 | 184332757103 |
10 | 60970020060 |
11 | 23947a94534 |
12 | b9968a0510 |
13 | 59986cb561 |
14 | 2d456390cc |
15 | 18bc9b11e0 |
hex | e3218acdc |
60970020060 has 96 divisors (see below), whose sum is σ = 179606613312. Its totient is φ = 15433390080.
The previous prime is 60970020047. The next prime is 60970020077. The reversal of 60970020060 is 6002007906.
It is a super-2 number, since 2×609700200602 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 243907 + ... + 425946.
It is an arithmetic number, because the mean of its divisors is an integer number (1870902222).
Almost surely, 260970020060 is an apocalyptic number.
60970020060 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
60970020060 is an abundant number, since it is smaller than the sum of its proper divisors (118636593252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60970020060 is a wasteful number, since it uses less digits than its factorization.
60970020060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669943 (or 669941 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 30.
Adding to 60970020060 its reverse (6002007906), we get a palindrome (66972027966).
The spelling of 60970020060 in words is "sixty billion, nine hundred seventy million, twenty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •