Base | Representation |
---|---|
bin | 110101011110101111… |
… | …0101101110110101001 |
3 | 101222102221221202100111 |
4 | 1222331132231312221 |
5 | 3340202103030112 |
6 | 124432133134321 |
7 | 11204020464061 |
oct | 1527536556651 |
9 | 358387852314 |
10 | 114848095657 |
11 | 44785835139 |
12 | 1a31248a3a1 |
13 | aaa3a40b69 |
14 | 57b70223a1 |
15 | 2ec2a455a7 |
hex | 1abd7adda9 |
114848095657 has 4 divisors (see below), whose sum is σ = 114848776900. Its totient is φ = 114847414416.
The previous prime is 114848095619. The next prime is 114848095693. The reversal of 114848095657 is 756590848411.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 756590848411 = 19 ⋅39820570969.
It can be written as a sum of positive squares in 2 ways, for example, as 59404800361 + 55443295296 = 243731^2 + 235464^2 .
It is a cyclic number.
It is not a de Polignac number, because 114848095657 - 219 = 114847571369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114848095697) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 118903 + ... + 493795.
It is an arithmetic number, because the mean of its divisors is an integer number (28712194225).
Almost surely, 2114848095657 is an apocalyptic number.
It is an amenable number.
114848095657 is a deficient number, since it is larger than the sum of its proper divisors (681243).
114848095657 is an equidigital number, since it uses as much as digits as its factorization.
114848095657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681242.
The product of its (nonzero) digits is 9676800, while the sum is 58.
The spelling of 114848095657 in words is "one hundred fourteen billion, eight hundred forty-eight million, ninety-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •