Base | Representation |
---|---|
bin | 1101001010011000110… |
… | …1101011000100101110 |
3 | 210121200011122210121210 |
4 | 3102212031223010232 |
5 | 12201101441322200 |
6 | 251514204135250 |
7 | 22223430643434 |
oct | 3224615530456 |
9 | 717604583553 |
10 | 226126901550 |
11 | 87999817020 |
12 | 379a9537526 |
13 | 18429164c34 |
14 | ad31daad54 |
15 | 5d37043650 |
hex | 34a636b12e |
226126901550 has 48 divisors (see below), whose sum is σ = 611776058112. Its totient is φ = 54818642400.
The previous prime is 226126901503. The next prime is 226126901563. The reversal of 226126901550 is 55109621622.
226126901550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2261269015502 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 226126901499 and 226126901508.
It is a congruent 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 23 ways as a sum of consecutive naturals, for example, 68521654 + ... + 68524953.
It is an arithmetic number, because the mean of its divisors is an integer number (12745334544).
Almost surely, 2226126901550 is an apocalyptic number.
226126901550 is an abundant number, since it is smaller than the sum of its proper divisors (385649156562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226126901550 is a wasteful number, since it uses less digits than its factorization.
226126901550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137046633 (or 137046628 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 226126901550 in words is "two hundred twenty-six billion, one hundred twenty-six million, nine hundred one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •