Base | Representation |
---|---|
bin | 1101101010000… |
… | …00110100001001 |
3 | 21222120021010210 |
4 | 12311000310021 |
5 | 213311412030 |
6 | 15211231333 |
7 | 2560513641 |
oct | 665006411 |
9 | 258507123 |
10 | 114560265 |
11 | 59736906 |
12 | 32448549 |
13 | 1a970c51 |
14 | 11301521 |
15 | a0cdbb0 |
hex | 6d40d09 |
114560265 has 8 divisors (see below), whose sum is σ = 183296448. Its totient is φ = 61098800.
The previous prime is 114560261. The next prime is 114560269. The reversal of 114560265 is 562065411.
It is an interprime number because it is at equal distance from previous prime (114560261) and next prime (114560269).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114560265 - 22 = 114560261 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (114560261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3818661 + ... + 3818690.
It is an arithmetic number, because the mean of its divisors is an integer number (22912056).
Almost surely, 2114560265 is an apocalyptic number.
114560265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
114560265 is a deficient number, since it is larger than the sum of its proper divisors (68736183).
114560265 is an equidigital number, since it uses as much as digits as its factorization.
114560265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7637359.
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 114560265 is about 10703.2829075943. The cubic root of 114560265 is about 485.6737933578.
The spelling of 114560265 in words is "one hundred fourteen million, five hundred sixty thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •