Base | Representation |
---|---|
bin | 110101001100000110… |
… | …0111000111000100011 |
3 | 101220211101002121010101 |
4 | 1222120030320320203 |
5 | 3332412000242001 |
6 | 124250112043231 |
7 | 11152354430602 |
oct | 1523014707043 |
9 | 356741077111 |
10 | 114222665251 |
11 | 44494798002 |
12 | 1a178b33517 |
13 | aa042b01b6 |
14 | 5757d39a39 |
15 | 2e87ba2a01 |
hex | 1a98338e23 |
114222665251 has 8 divisors (see below), whose sum is σ = 119192864544. Its totient is φ = 109252799040.
The previous prime is 114222665201. The next prime is 114222665299. The reversal of 114222665251 is 152566222411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114222665251 - 227 = 114088447523 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114222665251.
It is not an unprimeable number, because it can be changed into a prime (114222665201) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 831385 + ... + 958981.
It is an arithmetic number, because the mean of its divisors is an integer number (14899108068).
Almost surely, 2114222665251 is an apocalyptic number.
114222665251 is a deficient number, since it is larger than the sum of its proper divisors (4970199293).
114222665251 is a wasteful number, since it uses less digits than its factorization.
114222665251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166541.
The product of its digits is 57600, while the sum is 37.
Adding to 114222665251 its reverse (152566222411), we get a palindrome (266788887662).
The spelling of 114222665251 in words is "one hundred fourteen billion, two hundred twenty-two million, six hundred sixty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •