Base | Representation |
---|---|
bin | 1000101000001110… |
… | …1100111001010100 |
3 | 12222102101110221001 |
4 | 2022003230321110 |
5 | 14220423214012 |
6 | 1021500433044 |
7 | 111253411603 |
oct | 21203547124 |
9 | 5872343831 |
10 | 2316226132 |
11 | a894a3a80 |
12 | 547848784 |
13 | 2abb3690c |
14 | 17d893a3a |
15 | d8529357 |
hex | 8a0ece54 |
2316226132 has 192 divisors, whose sum is σ = 5211537408. Its totient is φ = 887040000.
The previous prime is 2316226097. The next prime is 2316226139.
2316226132 is nontrivially palindromic in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 2316226132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2316226139) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 22932882 + ... + 22932982.
It is an arithmetic number, because the mean of its divisors is an integer number (27143424).
Almost surely, 22316226132 is an apocalyptic number.
2316226132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2316226132 is an abundant number, since it is smaller than the sum of its proper divisors (2895311276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2316226132 is a wasteful number, since it uses less digits than its factorization.
2316226132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230 (or 228 counting only the distinct ones).
The product of its digits is 5184, while the sum is 28.
The square root of 2316226132 is about 48127.1870360195. The cubic root of 2316226132 is about 1323.1029945220.
It can be divided in two parts, 23162 and 26132, that added together give a palindrome (49294).
The spelling of 2316226132 in words is "two billion, three hundred sixteen million, two hundred twenty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •