Base | Representation |
---|---|
bin | 110101001110011100… |
… | …0011111011011111101 |
3 | 101221000211212210100010 |
4 | 1222130320133123331 |
5 | 3333042102013341 |
6 | 124301555253433 |
7 | 11154330130311 |
oct | 1523470373375 |
9 | 357024783303 |
10 | 114301204221 |
11 | 44525060546 |
12 | 1a19b2aa279 |
13 | aa1764b569 |
14 | 5764541b41 |
15 | 2e8ea18716 |
hex | 1a9ce1f6fd |
114301204221 has 4 divisors (see below), whose sum is σ = 152401605632. Its totient is φ = 76200802812.
The previous prime is 114301204211. The next prime is 114301204231. The reversal of 114301204221 is 122402103411.
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.
It is an interprime number because it is at equal distance from previous prime (114301204211) and next prime (114301204231).
It is not a de Polignac number, because 114301204221 - 217 = 114301073149 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 (114301204211) 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, 19050200701 + ... + 19050200706.
It is an arithmetic number, because the mean of its divisors is an integer number (38100401408).
Almost surely, 2114301204221 is an apocalyptic number.
It is an amenable number.
114301204221 is a deficient number, since it is larger than the sum of its proper divisors (38100401411).
114301204221 is an equidigital number, since it uses as much as digits as its factorization.
114301204221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38100401410.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 114301204221 its reverse (122402103411), we get a palindrome (236703307632).
The spelling of 114301204221 in words is "one hundred fourteen billion, three hundred one million, two hundred four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •