Base | Representation |
---|---|
bin | 110101010101010011… |
… | …0101101001101111111 |
3 | 101221121220002010021101 |
4 | 1222222212231031333 |
5 | 3334030021014403 |
6 | 124340501513531 |
7 | 11163124014346 |
oct | 1525246551577 |
9 | 357556063241 |
10 | 114531423103 |
11 | 44633003389 |
12 | 1a2444128a7 |
13 | aa53256356 |
14 | 5786d4cb5d |
15 | 2ea4d4171d |
hex | 1aaa9ad37f |
114531423103 has 4 divisors (see below), whose sum is σ = 120559392760. Its totient is φ = 108503453448.
The previous prime is 114531423089. The next prime is 114531423107. The reversal of 114531423103 is 301324135411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301324135411 = 13 ⋅23178779647.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114531423103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114531423107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3013984800 + ... + 3013984837.
It is an arithmetic number, because the mean of its divisors is an integer number (30139848190).
Almost surely, 2114531423103 is an apocalyptic number.
114531423103 is a deficient number, since it is larger than the sum of its proper divisors (6027969657).
114531423103 is an equidigital number, since it uses as much as digits as its factorization.
114531423103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6027969656.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 114531423103 its reverse (301324135411), we get a palindrome (415855558514).
The spelling of 114531423103 in words is "one hundred fourteen billion, five hundred thirty-one million, four hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •