Base | Representation |
---|---|
bin | 1000011101100001… |
… | …1100001100111000 |
3 | 12212021220120120010 |
4 | 2013120130030320 |
5 | 14122430044003 |
6 | 1013214301520 |
7 | 110166665433 |
oct | 20730341470 |
9 | 5767816503 |
10 | 2271331128 |
11 | a6611a770 |
12 | 5347b78a0 |
13 | 2a2748021 |
14 | 17792881a |
15 | d460c003 |
hex | 8761c338 |
2271331128 has 128 divisors (see below), whose sum is σ = 6287984640. Its totient is φ = 678000000.
The previous prime is 2271331103. The next prime is 2271331129. The reversal of 2271331128 is 8211331722.
It is a junction number, because it is equal to n+sod(n) for n = 2271331095 and 2271331104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2271331129) 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, 9049003 + ... + 9049253.
It is an arithmetic number, because the mean of its divisors is an integer number (49124880).
Almost surely, 22271331128 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 2271331128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3143992320).
2271331128 is an abundant number, since it is smaller than the sum of its proper divisors (4016653512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2271331128 is a wasteful number, since it uses less digits than its factorization.
2271331128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649 (or 645 counting only the distinct ones).
The product of its digits is 4032, while the sum is 30.
The square root of 2271331128 is about 47658.4843233605. The cubic root of 2271331128 is about 1314.4986697550.
The spelling of 2271331128 in words is "two billion, two hundred seventy-one million, three hundred thirty-one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •