Base | Representation |
---|---|
bin | 110101001010001111… |
… | …1100111011011101011 |
3 | 101220200001001112022012 |
4 | 1222110133213123223 |
5 | 3332300034400033 |
6 | 124240010550135 |
7 | 11151000642620 |
oct | 1522437473353 |
9 | 356601045265 |
10 | 114160465643 |
11 | 44462674574 |
12 | 1a16013834b |
13 | a9c4442cb3 |
14 | 574d988347 |
15 | 2e824b8248 |
hex | 1a947e76eb |
114160465643 has 8 divisors (see below), whose sum is σ = 131152189440. Its totient is φ = 97339513320.
The previous prime is 114160465637. The next prime is 114160465663. The reversal of 114160465643 is 346564061411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114160465643 - 218 = 114160203499 is a prime.
It is a super-2 number, since 2×1141604656432 (a number of 23 digits) contains 22 as substring.
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 114160465643.
It is not an unprimeable number, because it can be changed into a prime (114160465603) 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 7 ways as a sum of consecutive naturals, for example, 42691433 + ... + 42694106.
It is an arithmetic number, because the mean of its divisors is an integer number (16394023680).
Almost surely, 2114160465643 is an apocalyptic number.
114160465643 is a deficient number, since it is larger than the sum of its proper divisors (16991723797).
114160465643 is an equidigital number, since it uses as much as digits as its factorization.
114160465643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85385737.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 114160465643 in words is "one hundred fourteen billion, one hundred sixty million, four hundred sixty-five thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •