Base | Representation |
---|---|
bin | 110101011111100001… |
… | …1011000100010000100 |
3 | 101222111210121110112200 |
4 | 1222333003120202010 |
5 | 3340230332003433 |
6 | 124434514514500 |
7 | 11204461003413 |
oct | 1527703304204 |
9 | 358453543480 |
10 | 114874484868 |
11 | 44799719800 |
12 | 1a31b295a30 |
13 | aaa9350490 |
14 | 57ba73147a |
15 | 2ec5009613 |
hex | 1abf0d8884 |
114874484868 has 108 divisors (see below), whose sum is σ = 343726991244. Its totient is φ = 32132707200.
The previous prime is 114874484797. The next prime is 114874484887. The reversal of 114874484868 is 868484478411.
114874484868 is a `hidden beast` number, since 1 + 1 + 4 + 8 + 74 + 484 + 86 + 8 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 34444390464 + 80430094404 = 185592^2 + 283602^2 .
It is a super-2 number, since 2×1148744848682 (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 (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 957663 + ... + 1070918.
Almost surely, 2114874484868 is an apocalyptic number.
114874484868 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
114874484868 is an abundant number, since it is smaller than the sum of its proper divisors (228852506376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114874484868 is a wasteful number, since it uses less digits than its factorization.
114874484868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028626 (or 2028610 counting only the distinct ones).
The product of its digits is 44040192, while the sum is 63.
The spelling of 114874484868 in words is "one hundred fourteen billion, eight hundred seventy-four million, four hundred eighty-four thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •