Base | Representation |
---|---|
bin | 1111110101101011011… |
… | …0101000101111111100 |
3 | 222000100121201120111110 |
4 | 3331122312220233330 |
5 | 13424233421234042 |
6 | 325000533522020 |
7 | 25442033065134 |
oct | 3753266505774 |
9 | 860317646443 |
10 | 272107211772 |
11 | a5444477700 |
12 | 448a01a3310 |
13 | 1c8761ab0a6 |
14 | d2548ddac4 |
15 | 7128a7409c |
hex | 3f5ada8bfc |
272107211772 has 72 divisors (see below), whose sum is σ = 698015477376. Its totient is φ = 82441172000.
The previous prime is 272107211771. The next prime is 272107211773. The reversal of 272107211772 is 277112701272.
It is an interprime number because it is at equal distance from previous prime (272107211771) and next prime (272107211773).
It is a self number, because there is not a number n which added to its sum of digits gives 272107211772.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272107211771) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9410497 + ... + 9439367.
It is an arithmetic number, because the mean of its divisors is an integer number (9694659408).
Almost surely, 2272107211772 is an apocalyptic number.
272107211772 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
272107211772 is an abundant number, since it is smaller than the sum of its proper divisors (425908265604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272107211772 is a wasteful number, since it uses less digits than its factorization.
272107211772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35391 (or 35378 counting only the distinct ones).
The product of its (nonzero) digits is 38416, while the sum is 39.
The spelling of 272107211772 in words is "two hundred seventy-two billion, one hundred seven million, two hundred eleven thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •