Base | Representation |
---|---|
bin | 110011100000000010101000… |
… | …001001010001110011010000 |
3 | 1002200222101210220020212120002 |
4 | 303200002220021101303100 |
5 | 214142003014334420402 |
6 | 2121421403125305132 |
7 | 65465150033235161 |
oct | 6340025011216320 |
9 | 1080871726225502 |
10 | 226502216326352 |
11 | 66197061240aaa |
12 | 214a1791b651a8 |
13 | 99500b4c7a085 |
14 | 3dd0aa1381768 |
15 | 1b2bc98385602 |
hex | ce00a8251cd0 |
226502216326352 has 20 divisors (see below), whose sum is σ = 443778921035460. Its totient is φ = 111978623801088.
The previous prime is 226502216326339. The next prime is 226502216326369. The reversal of 226502216326352 is 253623612205622.
It can be written as a sum of positive squares in 2 ways, for example, as 39771740442256 + 186730475884096 = 6306484^2 + 13664936^2 .
It is a junction number, because it is equal to n+sod(n) for n = 226502216326297 and 226502216326306.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79530271163 + ... + 79530274010.
It is an arithmetic number, because the mean of its divisors is an integer number (22188946051773).
Almost surely, 2226502216326352 is an apocalyptic number.
It is an amenable number.
226502216326352 is a deficient number, since it is larger than the sum of its proper divisors (217276704709108).
226502216326352 is a wasteful number, since it uses less digits than its factorization.
226502216326352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159060545270 (or 159060545264 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 47.
The spelling of 226502216326352 in words is "two hundred twenty-six trillion, five hundred two billion, two hundred sixteen million, three hundred twenty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •