Base | Representation |
---|---|
bin | 1101001100111111001… |
… | …0111100111111011001 |
3 | 210200110210101111211101 |
4 | 3103033302330333121 |
5 | 12204014040240441 |
6 | 252111325031401 |
7 | 22246631531224 |
oct | 3231762747731 |
9 | 720423344741 |
10 | 226824540121 |
11 | 882175a3223 |
12 | 37b630b5561 |
13 | 1850a85851a |
14 | ad9a8cc5bb |
15 | 5d783eb231 |
hex | 34cfcbcfd9 |
226824540121 has 9 divisors (see below), whose sum is σ = 237126708021. Its totient is φ = 216952125852.
The previous prime is 226824540097. The next prime is 226824540157. The reversal of 226824540121 is 121045428622.
The square root of 226824540121 is 476261.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 226824540121 - 213 = 226824531929 is a prime.
It is a super-2 number, since 2×2268245401212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (226824540191) 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, 10943650 + ... + 10964356.
Almost surely, 2226824540121 is an apocalyptic number.
226824540121 is the 476261-st square number.
226824540121 is the 238131-st centered octagonal number.
It is an amenable number.
226824540121 is a deficient number, since it is larger than the sum of its proper divisors (10302167900).
226824540121 is an frugal number, since it uses more digits than its factorization.
226824540121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41460 (or 20730 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 37.
Adding to 226824540121 its reverse (121045428622), we get a palindrome (347869968743).
The spelling of 226824540121 in words is "two hundred twenty-six billion, eight hundred twenty-four million, five hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •