Base | Representation |
---|---|
bin | 110101010100101100… |
… | …1010111110010001100 |
3 | 101221120110221011002212 |
4 | 1222221121113302030 |
5 | 3334004323301340 |
6 | 124334455205552 |
7 | 11162456500625 |
oct | 1525131276214 |
9 | 357513834085 |
10 | 114511150220 |
11 | 44622617035 |
12 | 1a2396768b8 |
13 | aa4bca896c |
14 | 5784392a4c |
15 | 2ea3189a65 |
hex | 1aa9657c8c |
114511150220 has 48 divisors (see below), whose sum is σ = 247389629760. Its totient is φ = 44503869696.
The previous prime is 114511150211. The next prime is 114511150283. The reversal of 114511150220 is 22051115411.
It is a happy number.
It is a super-2 number, since 2×1145111502202 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 415235 + ... + 633594.
It is an arithmetic number, because the mean of its divisors is an integer number (5153950620).
Almost surely, 2114511150220 is an apocalyptic number.
114511150220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114511150220 is an abundant number, since it is smaller than the sum of its proper divisors (132878479540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114511150220 is a wasteful number, since it uses less digits than its factorization.
114511150220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1048994 (or 1048992 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 23.
Adding to 114511150220 its reverse (22051115411), we get a palindrome (136562265631).
The spelling of 114511150220 in words is "one hundred fourteen billion, five hundred eleven million, one hundred fifty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •