Base | Representation |
---|---|
bin | 110101010101100111… |
… | …1100001010001000010 |
3 | 101221122122012200110200 |
4 | 1222223033201101002 |
5 | 3334040240401200 |
6 | 124341523110030 |
7 | 11163313654536 |
oct | 1525317412102 |
9 | 357578180420 |
10 | 114542122050 |
11 | 44639050694 |
12 | 1a247b12316 |
13 | aa555310a5 |
14 | 5788535bc6 |
15 | 2ea5c56800 |
hex | 1aab3e1442 |
114542122050 has 36 divisors (see below), whose sum is σ = 307736502450. Its totient is φ = 30544565760.
The previous prime is 114542122039. The next prime is 114542122067. The reversal of 114542122050 is 50221245411.
It is a happy number.
114542122050 is a `hidden beast` number, since 1 + 1 + 454 + 2 + 1 + 2 + 205 + 0 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 45882925209 + 68659196841 = 214203^2 + 262029^2 .
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 17 ways as a sum of consecutive naturals, for example, 127268575 + ... + 127269474.
Almost surely, 2114542122050 is an apocalyptic number.
114542122050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114542122050 is an abundant number, since it is smaller than the sum of its proper divisors (193194380400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114542122050 is a wasteful number, since it uses less digits than its factorization.
114542122050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254538067 (or 254538059 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 114542122050 its reverse (50221245411), we get a palindrome (164763367461).
The spelling of 114542122050 in words is "one hundred fourteen billion, five hundred forty-two million, one hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •