Base | Representation |
---|---|
bin | 1101100111110… |
… | …10000110110001 |
3 | 21222000112211222 |
4 | 12303322012301 |
5 | 213223130031 |
6 | 15201114425 |
7 | 2555166362 |
oct | 663720661 |
9 | 258015758 |
10 | 114270641 |
11 | 59559251 |
12 | 32328a15 |
13 | 1a89c184 |
14 | 11267b69 |
15 | a072e7b |
hex | 6cfa1b1 |
114270641 has 4 divisors (see below), whose sum is σ = 114303732. Its totient is φ = 114237552.
The previous prime is 114270593. The next prime is 114270679. The reversal of 114270641 is 146072411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 146072411 = 37 ⋅3947903.
It can be written as a sum of positive squares in 2 ways, for example, as 48011041 + 66259600 = 6929^2 + 8140^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114270641 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 114270641.
It is not an unprimeable number, because it can be changed into a prime (114270691) 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, 10670 + ... + 18503.
It is an arithmetic number, because the mean of its divisors is an integer number (28575933).
Almost surely, 2114270641 is an apocalyptic number.
It is an amenable number.
114270641 is a deficient number, since it is larger than the sum of its proper divisors (33091).
114270641 is an equidigital number, since it uses as much as digits as its factorization.
114270641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33090.
The product of its (nonzero) digits is 1344, while the sum is 26.
The square root of 114270641 is about 10689.7446648645. The cubic root of 114270641 is about 485.2641647321.
The spelling of 114270641 in words is "one hundred fourteen million, two hundred seventy thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •