Base | Representation |
---|---|
bin | 1001111100110011… |
… | …0110101100101000 |
3 | 20220010212011122010 |
4 | 2133030312230220 |
5 | 20432230301422 |
6 | 1121011355520 |
7 | 123121450551 |
oct | 23714665450 |
9 | 6803764563 |
10 | 2670947112 |
11 | 1150753109 |
12 | 6265b2ba0 |
13 | 3374838a2 |
14 | 1b4a2d328 |
15 | 109746b0c |
hex | 9f336b28 |
2670947112 has 64 divisors (see below), whose sum is σ = 7079313600. Its totient is φ = 836858880.
The previous prime is 2670947101. The next prime is 2670947131. The reversal of 2670947112 is 2117490762.
It is a super-2 number, since 2×26709471122 = 14267916950202281088, which contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 346662 + ... + 354282.
It is an arithmetic number, because the mean of its divisors is an integer number (110614275).
Almost surely, 22670947112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2670947112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3539656800).
2670947112 is an abundant number, since it is smaller than the sum of its proper divisors (4408366488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2670947112 is a wasteful number, since it uses less digits than its factorization.
2670947112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8506 (or 8502 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 39.
The square root of 2670947112 is about 51681.2065648626. The cubic root of 2670947112 is about 1387.4641258154.
The spelling of 2670947112 in words is "two billion, six hundred seventy million, nine hundred forty-seven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •