Base | Representation |
---|---|
bin | 111111111111100… |
… | …1011100111000000 |
3 | 12112122110120101120 |
4 | 1333333023213000 |
5 | 13344200102211 |
6 | 553023232240 |
7 | 104132325432 |
oct | 17777134700 |
9 | 5478416346 |
10 | 2147269056 |
11 | a02094029 |
12 | 4bb148680 |
13 | 282b2b20a |
14 | 165272652 |
15 | c87a2d06 |
hex | 7ffcb9c0 |
2147269056 has 84 divisors (see below), whose sum is σ = 5824139736. Its totient is φ = 698193920.
The previous prime is 2147269043. The next prime is 2147269057. The reversal of 2147269056 is 6509627412.
It is a super-2 number, since 2×21472690562 = 9221528797710262272, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2147268999 and 2147269017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2147269057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 319426 + ... + 326078.
Almost surely, 22147269056 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 2147269056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2912069868).
2147269056 is an abundant number, since it is smaller than the sum of its proper divisors (3676870680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2147269056 is an equidigital number, since it uses as much as digits as its factorization.
2147269056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6750 (or 6699 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The square root of 2147269056 is about 46338.6345936088. The cubic root of 2147269056 is about 1290.1161796691.
The spelling of 2147269056 in words is "two billion, one hundred forty-seven million, two hundred sixty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •