Base | Representation |
---|---|
bin | 1101101000001… |
… | …00100000111011 |
3 | 21222002201100000 |
4 | 12310010200323 |
5 | 213231011100 |
6 | 15202044043 |
7 | 2555434566 |
oct | 664044073 |
9 | 258081300 |
10 | 114313275 |
11 | 5958828a |
12 | 32349623 |
13 | 1a8b56bb |
14 | 112794dd |
15 | a080900 |
hex | 6d0483b |
114313275 has 72 divisors (see below), whose sum is σ = 219541504. Its totient is φ = 58903200.
The previous prime is 114313271. The next prime is 114313279. The reversal of 114313275 is 572313411.
It is an interprime number because it is at equal distance from previous prime (114313271) and next prime (114313279).
It is not a de Polignac number, because 114313275 - 22 = 114313271 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114313271) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 188022 + ... + 188628.
Almost surely, 2114313275 is an apocalyptic number.
114313275 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
114313275 is a deficient number, since it is larger than the sum of its proper divisors (105228229).
114313275 is an equidigital number, since it uses as much as digits as its factorization.
114313275 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 663 (or 646 counting only the distinct ones).
The product of its digits is 2520, while the sum is 27.
The square root of 114313275 is about 10691.7386331691. The cubic root of 114313275 is about 485.3245073823.
Adding to 114313275 its reverse (572313411), we get a palindrome (686626686).
It can be divided in two parts, 11431 and 3275, that added together give a triangular number (14706 = T171).
The spelling of 114313275 in words is "one hundred fourteen million, three hundred thirteen thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •