Base | Representation |
---|---|
bin | 110101010010000001… |
… | …0101111100101001101 |
3 | 101221100012220221002021 |
4 | 1222210002233211031 |
5 | 3333313330113201 |
6 | 124321530130141 |
7 | 11160316164043 |
oct | 1524402574515 |
9 | 357305827067 |
10 | 114421332301 |
11 | 4458694a551 |
12 | 1a213580951 |
13 | aa364bb873 |
14 | 5776492393 |
15 | 2e9a346ea1 |
hex | 1aa40af94d |
114421332301 has 4 divisors (see below), whose sum is σ = 114606181600. Its totient is φ = 114236483004.
The previous prime is 114421332247. The next prime is 114421332313. The reversal of 114421332301 is 103233124411.
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: 103233124411 = 11953 ⋅8636587.
It is a cyclic number.
It is not a de Polignac number, because 114421332301 - 213 = 114421324109 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 (114421332341) 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, 92423721 + ... + 92424958.
It is an arithmetic number, because the mean of its divisors is an integer number (28651545400).
Almost surely, 2114421332301 is an apocalyptic number.
It is an amenable number.
114421332301 is a deficient number, since it is larger than the sum of its proper divisors (184849299).
114421332301 is an equidigital number, since it uses as much as digits as its factorization.
114421332301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184849298.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 114421332301 its reverse (103233124411), we get a palindrome (217654456712).
The spelling of 114421332301 in words is "one hundred fourteen billion, four hundred twenty-one million, three hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •