Base | Representation |
---|---|
bin | 110101001100010100… |
… | …0000111110110011001 |
3 | 101220211212112022020211 |
4 | 1222120220013312121 |
5 | 3332420312220231 |
6 | 124250525051121 |
7 | 11152502213554 |
oct | 1523050076631 |
9 | 356755468224 |
10 | 114229804441 |
11 | 44498823865 |
12 | 1a17b3b6aa1 |
13 | aa0590c87c |
14 | 5758c7769b |
15 | 2e88612eb1 |
hex | 1a98a07d99 |
114229804441 has 9 divisors (see below), whose sum is σ = 115116347199. Its totient is φ = 113350045104.
The previous prime is 114229804399. The next prime is 114229804453. The reversal of 114229804441 is 144408922411.
The square root of 114229804441 is 337979.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 67099131225 + 47130673216 = 259035^2 + 217096^2 .
It is not a de Polignac number, because 114229804441 - 227 = 114095586713 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114229804394 and 114229804403.
It is not an unprimeable number, because it can be changed into a prime (114229804541) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 46301890 + ... + 46304356.
Almost surely, 2114229804441 is an apocalyptic number.
114229804441 is the 337979-th square number.
114229804441 is the 168990-th centered octagonal number.
It is an amenable number.
114229804441 is a deficient number, since it is larger than the sum of its proper divisors (886542758).
114229804441 is an frugal number, since it uses more digits than its factorization.
114229804441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5208 (or 2604 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 40.
The spelling of 114229804441 in words is "one hundred fourteen billion, two hundred twenty-nine million, eight hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •