Base | Representation |
---|---|
bin | 11001111110011010010011… |
… | …100010110101000110001110 |
3 | 112222111020110002210012200012 |
4 | 121332122103202311012032 |
5 | 104433202022433121032 |
6 | 1042545045535233222 |
7 | 33030366040011011 |
oct | 3176322342650616 |
9 | 488436402705605 |
10 | 114240015520142 |
11 | 33444a11591566 |
12 | 10990592078812 |
13 | 4b98a30743915 |
14 | 202d363a0d378 |
15 | d319a1b926b2 |
hex | 67e6938b518e |
114240015520142 has 32 divisors (see below), whose sum is σ = 175342083998400. Its totient is φ = 55809408326400.
The previous prime is 114240015520093. The next prime is 114240015520159. The reversal of 114240015520142 is 241025510042411.
114240015520142 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1142400155201422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114240015520099 and 114240015520108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1074767 + ... + 15153717.
It is an arithmetic number, because the mean of its divisors is an integer number (5479440124950).
Almost surely, 2114240015520142 is an apocalyptic number.
114240015520142 is a deficient number, since it is larger than the sum of its proper divisors (61102068478258).
114240015520142 is a wasteful number, since it uses less digits than its factorization.
114240015520142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14079548.
The product of its (nonzero) digits is 12800, while the sum is 32.
Adding to 114240015520142 its reverse (241025510042411), we get a palindrome (355265525562553).
The spelling of 114240015520142 in words is "one hundred fourteen trillion, two hundred forty billion, fifteen million, five hundred twenty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •