Base | Representation |
---|---|
bin | 110101100000011111… |
… | …1010000001101100000 |
3 | 101222121001201012102220 |
4 | 1223000333100031200 |
5 | 3340312140103030 |
6 | 124442034511040 |
7 | 11205334005330 |
oct | 1530077201540 |
9 | 358531635386 |
10 | 114906956640 |
11 | 44805a88283 |
12 | 1a32a135480 |
13 | aab2cac548 |
14 | 57c0b850c0 |
15 | 2ec7cc0a10 |
hex | 1ac0fd0360 |
114906956640 has 768 divisors, whose sum is σ = 447718440960. Its totient is φ = 24192000000.
The previous prime is 114906956623. The next prime is 114906956641. The reversal of 114906956640 is 46659609411.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114906956641) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 457796515 + ... + 457796765.
It is an arithmetic number, because the mean of its divisors is an integer number (582966720).
Almost surely, 2114906956640 is an apocalyptic number.
114906956640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114906956640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223859220480).
114906956640 is an abundant number, since it is smaller than the sum of its proper divisors (332811484320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114906956640 is a wasteful number, since it uses less digits than its factorization.
114906956640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467 (or 459 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 114906956640 in words is "one hundred fourteen billion, nine hundred six million, nine hundred fifty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •