Base | Representation |
---|---|
bin | 110101011100100101… |
… | …1101101111001101110 |
3 | 101222020221022020021121 |
4 | 1222321023231321232 |
5 | 3340030124200004 |
6 | 124421040051154 |
7 | 11202153645640 |
oct | 1527113557156 |
9 | 358227266247 |
10 | 114776006254 |
11 | 44749077318 |
12 | 1a2b2303aba |
13 | aa91b20300 |
14 | 57ab618890 |
15 | 2ebb555854 |
hex | 1ab92ede6e |
114776006254 has 48 divisors (see below), whose sum is σ = 213522613920. Its totient is φ = 45306967680.
The previous prime is 114776006249. The next prime is 114776006263. The reversal of 114776006254 is 452600677411.
It is a super-2 number, since 2×1147760062542 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (43) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 114776006254.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1038112 + ... + 1143340.
It is an arithmetic number, because the mean of its divisors is an integer number (4448387790).
Almost surely, 2114776006254 is an apocalyptic number.
114776006254 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
114776006254 is a deficient number, since it is larger than the sum of its proper divisors (98746607666).
114776006254 is a wasteful number, since it uses less digits than its factorization.
114776006254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105725 (or 105712 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 43.
The spelling of 114776006254 in words is "one hundred fourteen billion, seven hundred seventy-six million, six thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •