Base | Representation |
---|---|
bin | 1101001011000100110… |
… | …0011101011111000101 |
3 | 210122011000022201211110 |
4 | 3102301030131133011 |
5 | 12201441122230000 |
6 | 251544344555233 |
7 | 22231125614640 |
oct | 3226114353705 |
9 | 718130281743 |
10 | 226311133125 |
11 | 87a83809a20 |
12 | 37a3b182b19 |
13 | 1845838abbc |
14 | ad4c646a57 |
15 | 5d482d5850 |
hex | 34b131d7c5 |
226311133125 has 160 divisors (see below), whose sum is σ = 472528742400. Its totient is φ = 93566880000.
The previous prime is 226311133091. The next prime is 226311133151. The reversal of 226311133125 is 521331113622.
It is not a de Polignac number, because 226311133125 - 28 = 226311132869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 226311133092 and 226311133101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 28726687 + ... + 28734563.
It is an arithmetic number, because the mean of its divisors is an integer number (2953304640).
Almost surely, 2226311133125 is an apocalyptic number.
226311133125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
226311133125 is an abundant number, since it is smaller than the sum of its proper divisors (246217609275).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226311133125 is a wasteful number, since it uses less digits than its factorization.
226311133125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8117 (or 8102 counting only the distinct ones).
The product of its digits is 6480, while the sum is 30.
Adding to 226311133125 its reverse (521331113622), we get a palindrome (747642246747).
The spelling of 226311133125 in words is "two hundred twenty-six billion, three hundred eleven million, one hundred thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •