Base | Representation |
---|---|
bin | 11001100101011110… |
… | …010000001001100100 |
3 | 2121220120212001000100 |
4 | 121211132100021210 |
5 | 422230342424220 |
6 | 20342013144100 |
7 | 1661534061636 |
oct | 314536201144 |
9 | 77816761010 |
10 | 27472233060 |
11 | 107183a5348 |
12 | 53a848b030 |
13 | 278a79320c |
14 | 148884aa56 |
15 | aabc65d90 |
hex | 665790264 |
27472233060 has 144 divisors (see below), whose sum is σ = 86102714880. Its totient is φ = 7086293760.
The previous prime is 27472232959. The next prime is 27472233067. The reversal of 27472233060 is 6033227472.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (27472233067) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 657061 + ... + 697619.
It is an arithmetic number, because the mean of its divisors is an integer number (597935520).
Almost surely, 227472233060 is an apocalyptic number.
27472233060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27472233060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43051357440).
27472233060 is an abundant number, since it is smaller than the sum of its proper divisors (58630481820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27472233060 is a wasteful number, since it uses less digits than its factorization.
27472233060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40698 (or 40693 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 36.
The spelling of 27472233060 in words is "twenty-seven billion, four hundred seventy-two million, two hundred thirty-three thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •