Base | Representation |
---|---|
bin | 10110000111000010… |
… | …01111100011001000 |
3 | 1010122020212221122220 |
4 | 23003201033203020 |
5 | 143302233044102 |
6 | 5241511414040 |
7 | 600104042010 |
oct | 130341174310 |
9 | 33566787586 |
10 | 11870206152 |
11 | 5041470632 |
12 | 2373384320 |
13 | 11722bbb2c |
14 | 8086b2c40 |
15 | 4971831bc |
hex | 2c384f8c8 |
11870206152 has 128 divisors (see below), whose sum is σ = 34582732800. Its totient is φ = 3325183488.
The previous prime is 11870206151. The next prime is 11870206177. The reversal of 11870206152 is 25160207811.
It is not an unprimeable number, because it can be changed into a prime (11870206151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2507724 + ... + 2512452.
It is an arithmetic number, because the mean of its divisors is an integer number (270177600).
Almost surely, 211870206152 is an apocalyptic number.
11870206152 is a gapful number since it is divisible by the number (12) 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 11870206152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17291366400).
11870206152 is an abundant number, since it is smaller than the sum of its proper divisors (22712526648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11870206152 is a wasteful number, since it uses less digits than its factorization.
11870206152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5035 (or 5031 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 33.
The spelling of 11870206152 in words is "eleven billion, eight hundred seventy million, two hundred six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •