Base | Representation |
---|---|
bin | 110101001100100000… |
… | …1110001111001111101 |
3 | 101220212100012000101202 |
4 | 1222121001301321331 |
5 | 3332424022432201 |
6 | 124251325145245 |
7 | 11152613325515 |
oct | 1523101617175 |
9 | 356770160352 |
10 | 114236530301 |
11 | 444a15a8023 |
12 | 1a1816bb225 |
13 | aa0712607a |
14 | 5759b08845 |
15 | 2e88ee0c6b |
hex | 1a99071e7d |
114236530301 has 4 divisors (see below), whose sum is σ = 114250437600. Its totient is φ = 114222623004.
The previous prime is 114236530277. The next prime is 114236530339. The reversal of 114236530301 is 103035632411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103035632411 = 53569 ⋅1923419.
It is a cyclic number.
It is not a de Polignac number, because 114236530301 - 26 = 114236530237 is a prime.
It is a super-2 number, since 2×1142365303012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114236530201) 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, 6941321 + ... + 6957758.
It is an arithmetic number, because the mean of its divisors is an integer number (28562609400).
Almost surely, 2114236530301 is an apocalyptic number.
It is an amenable number.
114236530301 is a deficient number, since it is larger than the sum of its proper divisors (13907299).
114236530301 is an equidigital number, since it uses as much as digits as its factorization.
114236530301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13907298.
The product of its (nonzero) digits is 6480, while the sum is 29.
The spelling of 114236530301 in words is "one hundred fourteen billion, two hundred thirty-six million, five hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •