Base | Representation |
---|---|
bin | 1101100111101… |
… | …10001101101101 |
3 | 21221222201222121 |
4 | 12303312031231 |
5 | 213222122301 |
6 | 15200512541 |
7 | 2555102041 |
oct | 663661555 |
9 | 257881877 |
10 | 114254701 |
11 | 59548280 |
12 | 3231b751 |
13 | 1a894b42 |
14 | 11262021 |
15 | a06d3a1 |
hex | 6cf636d |
114254701 has 8 divisors (see below), whose sum is σ = 124917408. Its totient is φ = 103638000.
The previous prime is 114254689. The next prime is 114254711. The reversal of 114254701 is 107452411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114254701 - 25 = 114254669 is a prime.
It is a super-3 number, since 3×1142547013 (a number of 25 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114254711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6195 + ... + 16336.
It is an arithmetic number, because the mean of its divisors is an integer number (15614676).
Almost surely, 2114254701 is an apocalyptic number.
114254701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114254701 is a deficient number, since it is larger than the sum of its proper divisors (10662707).
114254701 is a wasteful number, since it uses less digits than its factorization.
114254701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23003.
The product of its (nonzero) digits is 1120, while the sum is 25.
The square root of 114254701 is about 10688.9990644587. Note that the first 3 decimals coincide. The cubic root of 114254701 is about 485.2415999671.
The spelling of 114254701 in words is "one hundred fourteen million, two hundred fifty-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •