Base | Representation |
---|---|
bin | 110101001110011011… |
… | …1110001000011001101 |
3 | 101221000211112010201002 |
4 | 1222130313301003031 |
5 | 3333042024423341 |
6 | 124301551230045 |
7 | 11154325406342 |
oct | 1523467610315 |
9 | 357024463632 |
10 | 114301014221 |
11 | 44524a40819 |
12 | 1a19b218325 |
13 | aa175b2c34 |
14 | 57644d27c9 |
15 | 2e8e9cc29b |
hex | 1a9cdf10cd |
114301014221 has 6 divisors (see below), whose sum is σ = 118107084366. Its totient is φ = 110613883800.
The previous prime is 114301014211. The next prime is 114301014257. The reversal of 114301014221 is 122410103411.
It can be written as a sum of positive squares in only one way, i.e., 88215534121 + 26085480100 = 297011^2 + 161510^2 .
It is a de Polignac number, because none of the positive numbers 2k-114301014221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114301014193 and 114301014202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114301014211) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 59468870 + ... + 59470791.
It is an arithmetic number, because the mean of its divisors is an integer number (19684514061).
Almost surely, 2114301014221 is an apocalyptic number.
It is an amenable number.
114301014221 is a deficient number, since it is larger than the sum of its proper divisors (3806070145).
114301014221 is an equidigital number, since it uses as much as digits as its factorization.
114301014221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118939723 (or 118939692 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 114301014221 its reverse (122410103411), we get a palindrome (236711117632).
The spelling of 114301014221 in words is "one hundred fourteen billion, three hundred one million, fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •