| Base | Representation |
|---|---|
| bin | 11010000010010110111110… |
| … | …101001000000110101111010 |
| 3 | 120000110011201212212001001110 |
| 4 | 122002112332221000311322 |
| 5 | 110002123141301013200 |
| 6 | 1043313435212101150 |
| 7 | 33056112203545125 |
| oct | 3202267651006572 |
| 9 | 500404655761043 |
| 10 | 114511321501050 |
| 11 | 33539a847575a1 |
| 12 | 10a15089a647b6 |
| 13 | 4bb84a992a7b6 |
| 14 | 203c53dd433bc |
| 15 | d38a801e9b50 |
| hex | 6825bea40d7a |
114511321501050 has 192 divisors, whose sum is σ = 304471662566400. Its totient is φ = 28394869017600.
The previous prime is 114511321501007. The next prime is 114511321501061. The reversal of 114511321501050 is 50105123115411.
It is a super-2 number, since 2×1145113215010502 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 114511321500999 and 114511321501017.
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 95 ways as a sum of consecutive naturals, for example, 108266770 + ... + 109319330.
It is an arithmetic number, because the mean of its divisors is an integer number (1585789909200).
Almost surely, 2114511321501050 is an apocalyptic number.
114511321501050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 114511321501050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152235831283200).
114511321501050 is an abundant number, since it is smaller than the sum of its proper divisors (189960341065350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114511321501050 is a wasteful number, since it uses less digits than its factorization.
114511321501050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053301 (or 1053296 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 30.
Adding to 114511321501050 its reverse (50105123115411), we get a palindrome (164616444616461).
The spelling of 114511321501050 in words is "one hundred fourteen trillion, five hundred eleven billion, three hundred twenty-one million, five hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •