Base | Representation |
---|---|
bin | 11001111110001001101111… |
… | …100101110100000010000100 |
3 | 112222102112112202210210221011 |
4 | 121332021233211310002010 |
5 | 104432404113002001002 |
6 | 1042532545202332004 |
7 | 33026166254306650 |
oct | 3176115745640204 |
9 | 488375482723834 |
10 | 114222232453252 |
11 | 334384164a8170 |
12 | 1098904a65a004 |
13 | 4b97158448b31 |
14 | 202c557d31a60 |
15 | d312b088a8d7 |
hex | 67e26f974084 |
114222232453252 has 96 divisors (see below), whose sum is σ = 262982763509760. Its totient is φ = 42054811200000.
The previous prime is 114222232453223. The next prime is 114222232453253. The reversal of 114222232453252 is 252354232222411.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (114222232453253) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 21990624 + ... + 26683927.
It is an arithmetic number, because the mean of its divisors is an integer number (2739403786560).
Almost surely, 2114222232453252 is an apocalyptic number.
It is an amenable number.
114222232453252 is an abundant number, since it is smaller than the sum of its proper divisors (148760531056508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114222232453252 is a wasteful number, since it uses less digits than its factorization.
114222232453252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48674993 (or 48674991 counting only the distinct ones).
The product of its digits is 460800, while the sum is 40.
Adding to 114222232453252 its reverse (252354232222411), we get a palindrome (366576464675663).
The spelling of 114222232453252 in words is "one hundred fourteen trillion, two hundred twenty-two billion, two hundred thirty-two million, four hundred fifty-three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •