Base | Representation |
---|---|
bin | 1101001100111100001… |
… | …0101111010011001000 |
3 | 210200102220121101101112 |
4 | 3103033002233103020 |
5 | 12204002321314003 |
6 | 252110154105452 |
7 | 22246416230651 |
oct | 3231702572310 |
9 | 720386541345 |
10 | 226811901128 |
11 | 8821045037a |
12 | 37b5aa1b288 |
13 | 18508051727 |
14 | ad98d5c528 |
15 | 5d772513d8 |
hex | 34cf0af4c8 |
226811901128 has 36 divisors (see below), whose sum is σ = 428311982385. Its totient is φ = 112601098944.
The previous prime is 226811901119. The next prime is 226811901133. The reversal of 226811901128 is 821109118622.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
226811901128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 154828084324 + 71983816804 = 393482^2 + 268298^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=336758.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 219565700 + ... + 219566732.
Almost surely, 2226811901128 is an apocalyptic number.
It is an amenable number.
226811901128 is a deficient number, since it is larger than the sum of its proper divisors (201500081257).
226811901128 is an frugal number, since it uses more digits than its factorization.
226811901128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2398 (or 1198 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 41.
The spelling of 226811901128 in words is "two hundred twenty-six billion, eight hundred eleven million, nine hundred one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •