Base | Representation |
---|---|
bin | 11001111110011101001101… |
… | …110011000000001110100111 |
3 | 112222111112111212122121021022 |
4 | 121332131031303000032213 |
5 | 104433224422410302330 |
6 | 1042550324002441355 |
7 | 33030536342255102 |
oct | 3176351563001647 |
9 | 488445455577238 |
10 | 114243140322215 |
11 | 33446275443613 |
12 | 1099110466325b |
13 | 4b9910ac43a28 |
14 | 202d57ca21739 |
15 | d31ad6189ae5 |
hex | 67e74dcc03a7 |
114243140322215 has 4 divisors (see below), whose sum is σ = 137091768386664. Its totient is φ = 91394512257768.
The previous prime is 114243140322169. The next prime is 114243140322257. The reversal of 114243140322215 is 512223041342411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114243140322215 is a prime.
It is a super-2 number, since 2×1142431403222152 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11424314032217 + ... + 11424314032226.
It is an arithmetic number, because the mean of its divisors is an integer number (34272942096666).
Almost surely, 2114243140322215 is an apocalyptic number.
114243140322215 is a deficient number, since it is larger than the sum of its proper divisors (22848628064449).
114243140322215 is an equidigital number, since it uses as much as digits as its factorization.
114243140322215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22848628064448.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 114243140322215 its reverse (512223041342411), we get a palindrome (626466181664626).
The spelling of 114243140322215 in words is "one hundred fourteen trillion, two hundred forty-three billion, one hundred forty million, three hundred twenty-two thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •