Base | Representation |
---|---|
bin | 1101101001111… |
… | …10010111111111 |
3 | 21222112202102122 |
4 | 12310332113333 |
5 | 213311102041 |
6 | 15211113155 |
7 | 2560442543 |
oct | 664762777 |
9 | 258482378 |
10 | 114550271 |
11 | 5972a350 |
12 | 324427bb |
13 | 1a969534 |
14 | 112dba23 |
15 | a0cac4b |
hex | 6d3e5ff |
114550271 has 4 divisors (see below), whose sum is σ = 124963944. Its totient is φ = 104136600.
The previous prime is 114550243. The next prime is 114550279. The reversal of 114550271 is 172055411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 172055411 = 11 ⋅15641401.
It is a cyclic number.
It is not a de Polignac number, because 114550271 - 26 = 114550207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114550271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114550279) 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, 5206820 + ... + 5206841.
It is an arithmetic number, because the mean of its divisors is an integer number (31240986).
Almost surely, 2114550271 is an apocalyptic number.
114550271 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
114550271 is a deficient number, since it is larger than the sum of its proper divisors (10413673).
114550271 is a wasteful number, since it uses less digits than its factorization.
114550271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10413672.
The product of its (nonzero) digits is 1400, while the sum is 26.
The square root of 114550271 is about 10702.8160313069. The cubic root of 114550271 is about 485.6596698888.
The spelling of 114550271 in words is "one hundred fourteen million, five hundred fifty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •