Base | Representation |
---|---|
bin | 11010000010110100101100… |
… | …000100100100001010110010 |
3 | 120000120020002002200000122122 |
4 | 122002310230010210022302 |
5 | 110003134004341230000 |
6 | 1043340232503034242 |
7 | 33061321553242130 |
oct | 3202645404441262 |
9 | 500506062600578 |
10 | 114543222211250 |
11 | 335515648912a8 |
12 | 10a1b2b143b982 |
13 | 4bbb4c1a14791 |
14 | 203dcc899c750 |
15 | d397eab22085 |
hex | 682d2c1242b2 |
114543222211250 has 40 divisors (see below), whose sum is σ = 245371217976192. Its totient is φ = 39271961898000.
The previous prime is 114543222211199. The next prime is 114543222211291. The reversal of 114543222211250 is 52112222345411.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 114543222211250.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6545318234 + ... + 6545335733.
Almost surely, 2114543222211250 is an apocalyptic number.
114543222211250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114543222211250 is an abundant number, since it is smaller than the sum of its proper divisors (130827995764942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114543222211250 is an equidigital number, since it uses as much as digits as its factorization.
114543222211250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13090653996 (or 13090653981 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 114543222211250 its reverse (52112222345411), we get a palindrome (166655444556661).
The spelling of 114543222211250 in words is "one hundred fourteen trillion, five hundred forty-three billion, two hundred twenty-two million, two hundred eleven thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •