Base | Representation |
---|---|
bin | 11001111100100101011011… |
… | …110000011001011100111000 |
3 | 112222001020112111011202001100 |
4 | 121330211123300121130320 |
5 | 104424123022012014430 |
6 | 1042411253404451400 |
7 | 33015334215314415 |
oct | 3174453360313470 |
9 | 488036474152040 |
10 | 114114525501240 |
11 | 333a677575aa40 |
12 | 109701ab849b60 |
13 | 4b89c5202b974 |
14 | 202725b4cb10c |
15 | d2d5a9c3e960 |
hex | 67c95bc19738 |
114114525501240 has 288 divisors, whose sum is σ = 427002708553200. Its totient is φ = 26208120360960.
The previous prime is 114114525501233. The next prime is 114114525501287. The reversal of 114114525501240 is 42105525411411.
114114525501240 is a `hidden beast` number, since 1 + 1 + 4 + 1 + 1 + 4 + 52 + 550 + 12 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 114114525501195 and 114114525501204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 38482905 + ... + 41342024.
Almost surely, 2114114525501240 is an apocalyptic number.
114114525501240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114114525501240 is an abundant number, since it is smaller than the sum of its proper divisors (312888183051960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114114525501240 is a wasteful number, since it uses less digits than its factorization.
114114525501240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79824995 (or 79824969 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 36.
The spelling of 114114525501240 in words is "one hundred fourteen trillion, one hundred fourteen billion, five hundred twenty-five million, five hundred one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •