Base | Representation |
---|---|
bin | 1101001001111101010… |
… | …0000001010110010010 |
3 | 210121101002210202020112 |
4 | 3102133110001112102 |
5 | 12200332322001023 |
6 | 251454510441322 |
7 | 22220523603041 |
oct | 3223724012622 |
9 | 717332722215 |
10 | 226011125138 |
11 | 8793a42a537 |
12 | 37976803242 |
13 | 1840b189596 |
14 | ad20870558 |
15 | 5d2bcc4478 |
hex | 349f501592 |
226011125138 has 6 divisors (see below), whose sum is σ = 339017696199. Its totient is φ = 113005226406.
The previous prime is 226011125129. The next prime is 226011125143. The reversal of 226011125138 is 831521110622.
226011125138 is digitally balanced in base 3, 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 only one way, i.e., 113005562569 + 113005562569 = 336163^2 + 336163^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=336163.
It is a super-2 number, since 2×2260111251382 (a number of 24 digits) contains 22 as substring.
It is a Duffinian 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 2 ways as a sum of consecutive naturals, for example, 504245 + ... + 840407.
Almost surely, 2226011125138 is an apocalyptic number.
226011125138 is a deficient number, since it is larger than the sum of its proper divisors (113006571061).
226011125138 is an frugal number, since it uses more digits than its factorization.
226011125138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672328 (or 336165 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 32.
Multiplying 226011125138 by its sum of digits (32), we get a square (7232356004416 = 26893042).
The spelling of 226011125138 in words is "two hundred twenty-six billion, eleven million, one hundred twenty-five thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •