Base | Representation |
---|---|
bin | 111111101000111… |
… | …1010111001100000 |
3 | 12111211010202202210 |
4 | 1333101322321200 |
5 | 13333130413003 |
6 | 551521042120 |
7 | 103626431004 |
oct | 17721727140 |
9 | 5454122683 |
10 | 2135404128 |
11 | 9a641a800 |
12 | 4b7186340 |
13 | 280535850 |
14 | 163864704 |
15 | c770c503 |
hex | 7f47ae60 |
2135404128 has 288 divisors, whose sum is σ = 6756825600. Its totient is φ = 586460160.
The previous prime is 2135404127. The next prime is 2135404151. The reversal of 2135404128 is 8214045312.
It is a junction number, because it is equal to n+sod(n) for n = 2135404095 and 2135404104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2135404121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11929543 + ... + 11929721.
It is an arithmetic number, because the mean of its divisors is an integer number (23461200).
Almost surely, 22135404128 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 2135404128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3378412800).
2135404128 is an abundant number, since it is smaller than the sum of its proper divisors (4621421472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2135404128 is a wasteful number, since it uses less digits than its factorization.
2135404128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306 (or 287 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 2135404128 is about 46210.4331076868. The cubic root of 2135404128 is about 1287.7355719138.
The spelling of 2135404128 in words is "two billion, one hundred thirty-five million, four hundred four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •