Base | Representation |
---|---|
bin | 110101011100001111… |
… | …0001010011110110000 |
3 | 101222020002211112112101 |
4 | 1222320132022132300 |
5 | 3340014100032223 |
6 | 124415532110144 |
7 | 11201650311610 |
oct | 1527036123660 |
9 | 358202745471 |
10 | 114764064688 |
11 | 44742360459 |
12 | 1a2aa305354 |
13 | aa8c4cbab0 |
14 | 57a9bcaa40 |
15 | 2eba4974ad |
hex | 1ab878a7b0 |
114764064688 has 80 divisors (see below), whose sum is σ = 275058020160. Its totient is φ = 45170592768.
The previous prime is 114764064677. The next prime is 114764064703. The reversal of 114764064688 is 886460467411.
It is a super-2 number, since 2×1147640646882 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86778 + ... + 486886.
It is an arithmetic number, because the mean of its divisors is an integer number (3438225252).
Almost surely, 2114764064688 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 114764064688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137529010080).
114764064688 is an abundant number, since it is smaller than the sum of its proper divisors (160293955472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114764064688 is a wasteful number, since it uses less digits than its factorization.
114764064688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400334 (or 400328 counting only the distinct ones).
The product of its (nonzero) digits is 6193152, while the sum is 55.
The spelling of 114764064688 in words is "one hundred fourteen billion, seven hundred sixty-four million, sixty-four thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •