Base | Representation |
---|---|
bin | 110011011011010011111100… |
… | …100110000101100101101011 |
3 | 1002122211022221001010220102201 |
4 | 303123103330212011211223 |
5 | 214121141414201301110 |
6 | 2121012213425041031 |
7 | 65432523152123650 |
oct | 6333237446054553 |
9 | 1078738831126381 |
10 | 226177215650155 |
11 | 66081244896740 |
12 | 2144a7aba86177 |
13 | 992855c739253 |
14 | 3dbd06db5bc27 |
15 | 1b235c5e1db3a |
hex | cdb4fc98596b |
226177215650155 has 32 divisors (see below), whose sum is σ = 338399195512320. Its totient is φ = 140987513157120.
The previous prime is 226177215650137. The next prime is 226177215650159. The reversal of 226177215650155 is 551056512771622.
It is not a de Polignac number, because 226177215650155 - 211 = 226177215648107 is a prime.
It is a super-2 number, since 2×2261772156501552 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a junction number, because it is equal to n+sod(n) for n = 226177215650096 and 226177215650105.
It is not an unprimeable number, because it can be changed into a prime (226177215650159) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3703950 + ... + 21588739.
It is an arithmetic number, because the mean of its divisors is an integer number (10574974859760).
Almost surely, 2226177215650155 is an apocalyptic number.
226177215650155 is a deficient number, since it is larger than the sum of its proper divisors (112221979862165).
226177215650155 is a wasteful number, since it uses less digits than its factorization.
226177215650155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25315939.
The product of its (nonzero) digits is 8820000, while the sum is 55.
The spelling of 226177215650155 in words is "two hundred twenty-six trillion, one hundred seventy-seven billion, two hundred fifteen million, six hundred fifty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •