Base | Representation |
---|---|
bin | 1101100110011… |
… | …00011100100111 |
3 | 21221200001022101 |
4 | 12303030130213 |
5 | 213201133443 |
6 | 15153112531 |
7 | 2553460213 |
oct | 663143447 |
9 | 257601271 |
10 | 114083623 |
11 | 59440795 |
12 | 32258747 |
13 | 1a835004 |
14 | 11219943 |
15 | a03784d |
hex | 6ccc727 |
114083623 has 4 divisors (see below), whose sum is σ = 114274048. Its totient is φ = 113893200.
The previous prime is 114083621. The next prime is 114083633. The reversal of 114083623 is 326380411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 326380411 = 7 ⋅46625773.
It is a cyclic number.
It is not a de Polignac number, because 114083623 - 21 = 114083621 is a prime.
It is a super-2 number, since 2×1140836232 = 26030146073612258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114083591 and 114083600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114083621) 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, 94311 + ... + 95512.
It is an arithmetic number, because the mean of its divisors is an integer number (28568512).
Almost surely, 2114083623 is an apocalyptic number.
114083623 is a deficient number, since it is larger than the sum of its proper divisors (190425).
114083623 is an equidigital number, since it uses as much as digits as its factorization.
114083623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190424.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 114083623 is about 10680.9935399288. The cubic root of 114083623 is about 484.9992886233. Note that the first 3 decimals are identical.
The spelling of 114083623 in words is "one hundred fourteen million, eighty-three thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •