Base | Representation |
---|---|
bin | 1000010111111000… |
… | …0010000100011000 |
3 | 12210122022111021100 |
4 | 2011332002010120 |
5 | 14100343144003 |
6 | 1011010311400 |
7 | 106461356301 |
oct | 20576020430 |
9 | 5718274240 |
10 | 2247631128 |
11 | a53802596 |
12 | 528888560 |
13 | 29a86a762 |
14 | 1747197a8 |
15 | d24c9ba3 |
hex | 85f82118 |
2247631128 has 48 divisors (see below), whose sum is σ = 6108167520. Its totient is φ = 746646336.
The previous prime is 2247631117. The next prime is 2247631147. The reversal of 2247631128 is 8211367422.
It is a happy number.
2247631128 is a `hidden beast` number, since 2 + 2 + 4 + 7 + 631 + 12 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2247631092 and 2247631101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32176 + ... + 74367.
It is an arithmetic number, because the mean of its divisors is an integer number (127253490).
Almost surely, 22247631128 is an apocalyptic number.
It is an amenable number.
2247631128 is an abundant number, since it is smaller than the sum of its proper divisors (3860536392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2247631128 is a wasteful number, since it uses less digits than its factorization.
2247631128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106848 (or 106841 counting only the distinct ones).
The product of its digits is 32256, while the sum is 36.
The square root of 2247631128 is about 47409.1882233813. The cubic root of 2247631128 is about 1309.9106688886.
It can be divided in two parts, 2247 and 631128, that added together give a triangular number (633375 = T1125).
The spelling of 2247631128 in words is "two billion, two hundred forty-seven million, six hundred thirty-one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •