Base | Representation |
---|---|
bin | 1101001001111100000… |
… | …1101111010001100001 |
3 | 210121100202210020222220 |
4 | 3102133001233101201 |
5 | 12200330110120023 |
6 | 251454220021253 |
7 | 22220435062263 |
oct | 3223701572141 |
9 | 717322706886 |
10 | 226006332513 |
11 | 87937756795 |
12 | 37975091829 |
13 | 1840a19c000 |
14 | ad1dd83b33 |
15 | 5d2b6793e3 |
hex | 349f06f461 |
226006332513 has 32 divisors (see below), whose sum is σ = 326614901760. Its totient is φ = 139007232000.
The previous prime is 226006332457. The next prime is 226006332523. The reversal of 226006332513 is 315233600622.
226006332513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 226006332513 - 230 = 224932590689 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (226006332523) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 14116513 + ... + 14132513.
It is an arithmetic number, because the mean of its divisors is an integer number (10206715680).
Almost surely, 2226006332513 is an apocalyptic number.
It is an amenable number.
226006332513 is a deficient number, since it is larger than the sum of its proper divisors (100608569247).
226006332513 is a wasteful number, since it uses less digits than its factorization.
226006332513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18186 (or 18160 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 33.
The spelling of 226006332513 in words is "two hundred twenty-six billion, six million, three hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •