Base | Representation |
---|---|
bin | 1101101010111… |
… | …11110000101001 |
3 | 21222210201000022 |
4 | 12311133300221 |
5 | 213324441032 |
6 | 15214050225 |
7 | 2561552324 |
oct | 665376051 |
9 | 258721008 |
10 | 114687017 |
11 | 59813065 |
12 | 324a9975 |
13 | 1a9b6853 |
14 | 113357bb |
15 | a106512 |
hex | 6d5fc29 |
114687017 has 4 divisors (see below), whose sum is σ = 114712836. Its totient is φ = 114661200.
The previous prime is 114687007. The next prime is 114687019. The reversal of 114687017 is 710786411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 710786411 = 23 ⋅30903757.
It can be written as a sum of positive squares in 2 ways, for example, as 61528336 + 53158681 = 7844^2 + 7291^2 .
It is a cyclic number.
It is not a de Polignac number, because 114687017 - 26 = 114686953 is a prime.
It is a super-2 number, since 2×1146870172 = 26306223736716578, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 14.
It is not an unprimeable number, because it can be changed into a prime (114687019) 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, 4358 + ... + 15759.
It is an arithmetic number, because the mean of its divisors is an integer number (28678209).
Almost surely, 2114687017 is an apocalyptic number.
It is an amenable number.
114687017 is a deficient number, since it is larger than the sum of its proper divisors (25819).
114687017 is an equidigital number, since it uses as much as digits as its factorization.
114687017 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25818.
The product of its (nonzero) digits is 9408, while the sum is 35.
The square root of 114687017 is about 10709.2024446268. The cubic root of 114687017 is about 485.8528473977.
The spelling of 114687017 in words is "one hundred fourteen million, six hundred eighty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •