Base | Representation |
---|---|
bin | 110101010111011010… |
… | …0111001000010111011 |
3 | 101221210211100112002121 |
4 | 1222232310321002323 |
5 | 3334201134003202 |
6 | 124351511542111 |
7 | 11164644025120 |
oct | 1525664710273 |
9 | 357724315077 |
10 | 114602250427 |
11 | 44669a89a65 |
12 | 1a26408a937 |
13 | aa64b24602 |
14 | 5792508747 |
15 | 2eab182537 |
hex | 1aaed390bb |
114602250427 has 4 divisors (see below), whose sum is σ = 130974000496. Its totient is φ = 98230500360.
The previous prime is 114602250407. The next prime is 114602250461. The reversal of 114602250427 is 724052206411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 724052206411 = 142673 ⋅5074907.
It is a cyclic number.
It is not a de Polignac number, because 114602250427 - 219 = 114601726139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114602250392 and 114602250401.
It is not an unprimeable number, because it can be changed into a prime (114602250407) 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, 8185875024 + ... + 8185875037.
It is an arithmetic number, because the mean of its divisors is an integer number (32743500124).
Almost surely, 2114602250427 is an apocalyptic number.
114602250427 is a deficient number, since it is larger than the sum of its proper divisors (16371750069).
114602250427 is an equidigital number, since it uses as much as digits as its factorization.
114602250427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16371750068.
The product of its (nonzero) digits is 26880, while the sum is 34.
Adding to 114602250427 its reverse (724052206411), we get a palindrome (838654456838).
The spelling of 114602250427 in words is "one hundred fourteen billion, six hundred two million, two hundred fifty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •