Base | Representation |
---|---|
bin | 1101010110110011110… |
… | …0101100110111101001 |
3 | 210221021112120120100021 |
4 | 3111230330230313221 |
5 | 12224414021242231 |
6 | 253225112040441 |
7 | 22402155216412 |
oct | 3255474546751 |
9 | 727245516307 |
10 | 229461118441 |
11 | 8934a901575 |
12 | 3857a093121 |
13 | 1883ab67739 |
14 | b16ab32809 |
15 | 5e7eb04811 |
hex | 356cf2cde9 |
229461118441 has 27 divisors (see below), whose sum is σ = 244699172599. Its totient is φ = 215153240192.
The previous prime is 229461118429. The next prime is 229461118511. The reversal of 229461118441 is 144811164922.
The square root of 229461118441 is 479021.
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., 93223355625 + 136237762816 = 305325^2 + 369104^2 .
It is not a de Polignac number, because 229461118441 - 223 = 229452729833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (229461118141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 650031321 + ... + 650031673.
Almost surely, 2229461118441 is an apocalyptic number.
229461118441 is the 479021-st square number.
229461118441 is the 239511-st centered octagonal number.
It is an amenable number.
229461118441 is a deficient number, since it is larger than the sum of its proper divisors (15238054158).
229461118441 is an frugal number, since it uses more digits than its factorization.
229461118441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870 (or 435 counting only the distinct ones).
The product of its digits is 110592, while the sum is 43.
The spelling of 229461118441 in words is "two hundred twenty-nine billion, four hundred sixty-one million, one hundred eighteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •