Base | Representation |
---|---|
bin | 110101001111101011… |
… | …0011010100100111001 |
3 | 101221010201210001212122 |
4 | 1222133112122210321 |
5 | 3333133201244230 |
6 | 124310034451025 |
7 | 11155342042535 |
oct | 1523726324471 |
9 | 357121701778 |
10 | 114342603065 |
11 | 44546467069 |
12 | 1a1b1133a75 |
13 | aa230b4a12 |
14 | 5769c3abc5 |
15 | 2e93494be5 |
hex | 1a9f59a939 |
114342603065 has 8 divisors (see below), whose sum is σ = 139800013128. Its totient is φ = 89748156160.
The previous prime is 114342603047. The next prime is 114342603073. The reversal of 114342603065 is 560306243411.
It can be written as a sum of positive squares in 4 ways, for example, as 58395689104 + 55946913961 = 241652^2 + 236531^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-114342603065 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215740496 + ... + 215741025.
It is an arithmetic number, because the mean of its divisors is an integer number (17475001641).
Almost surely, 2114342603065 is an apocalyptic number.
It is an amenable number.
114342603065 is a deficient number, since it is larger than the sum of its proper divisors (25457410063).
114342603065 is an equidigital number, since it uses as much as digits as its factorization.
114342603065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431481579.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 114342603065 its reverse (560306243411), we get a palindrome (674648846476).
The spelling of 114342603065 in words is "one hundred fourteen billion, three hundred forty-two million, six hundred three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •