Base | Representation |
---|---|
bin | 1101001010110100111… |
… | …1100010101010100001 |
3 | 210121222101120021122201 |
4 | 3102231033202222201 |
5 | 12201322134110110 |
6 | 251534015533201 |
7 | 22226362224631 |
oct | 3225517425241 |
9 | 717871507581 |
10 | 226244831905 |
11 | 87a4a344924 |
12 | 37a20b2a201 |
13 | 18447715b01 |
14 | ad439086c1 |
15 | 5d4258ab3a |
hex | 34ad3e2aa1 |
226244831905 has 8 divisors (see below), whose sum is σ = 271676140200. Its totient is φ = 180874304256.
The previous prime is 226244831899. The next prime is 226244831921. The reversal of 226244831905 is 509138442622.
226244831905 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 4 ways, for example, as 565678656 + 225679153249 = 23784^2 + 475057^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 226244831905 - 219 = 226244307617 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 15186970 + ... + 15201859.
It is an arithmetic number, because the mean of its divisors is an integer number (33959517525).
Almost surely, 2226244831905 is an apocalyptic number.
It is an amenable number.
226244831905 is a deficient number, since it is larger than the sum of its proper divisors (45431308295).
226244831905 is a wasteful number, since it uses less digits than its factorization.
226244831905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30390323.
The product of its (nonzero) digits is 829440, while the sum is 46.
The spelling of 226244831905 in words is "two hundred twenty-six billion, two hundred forty-four million, eight hundred thirty-one thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •