Base | Representation |
---|---|
bin | 11001010101101011… |
… | …011011100001101000 |
3 | 2121020010020121102200 |
4 | 121111223123201220 |
5 | 421210024031242 |
6 | 20255425500200 |
7 | 1652135553420 |
oct | 312553334150 |
9 | 77203217380 |
10 | 27207252072 |
11 | 105a186a1a0 |
12 | 53337a1660 |
13 | 2747906a30 |
14 | 1461591480 |
15 | a9387304c |
hex | 655adb868 |
27207252072 has 384 divisors, whose sum is σ = 99431055360. Its totient is φ = 6490575360.
The previous prime is 27207252067. The next prime is 27207252073. The reversal of 27207252072 is 27025270272.
It is a happy number.
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 (27207252073) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16359513 + ... + 16361175.
It is an arithmetic number, because the mean of its divisors is an integer number (258935040).
Almost surely, 227207252072 is an apocalyptic number.
27207252072 is a gapful number since it is divisible by the number (22) 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 27207252072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49715527680).
27207252072 is an abundant number, since it is smaller than the sum of its proper divisors (72223803288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27207252072 is a wasteful number, since it uses less digits than its factorization.
27207252072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1933 (or 1926 counting only the distinct ones).
The product of its (nonzero) digits is 54880, while the sum is 36.
The spelling of 27207252072 in words is "twenty-seven billion, two hundred seven million, two hundred fifty-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •