Base | Representation |
---|---|
bin | 1011111011011111001100… |
… | …10011000010010111111100 |
3 | 10102212212112211120012111010 |
4 | 11331233212103002113330 |
5 | 11414301123112324222 |
6 | 131443213512355220 |
7 | 5345200604402223 |
oct | 575574623022774 |
9 | 112785484505433 |
10 | 26233229026812 |
11 | 83a44a4983315 |
12 | 2b382133a5b10 |
13 | 1183a23cba632 |
14 | 6699a3359cba |
15 | 3075be60080c |
hex | 17dbe64c25fc |
26233229026812 has 48 divisors (see below), whose sum is σ = 61450741793952. Its totient is φ = 8710143836160.
The previous prime is 26233229026793. The next prime is 26233229026831. The reversal of 26233229026812 is 21862092233262.
It is an interprime number because it is at equal distance from previous prime (26233229026793) and next prime (26233229026831).
It is a super-3 number, since 3×262332290268123 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137515848 + ... + 137706480.
It is an arithmetic number, because the mean of its divisors is an integer number (1280223787374).
Almost surely, 226233229026812 is an apocalyptic number.
It is an amenable number.
26233229026812 is an abundant number, since it is smaller than the sum of its proper divisors (35217512767140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26233229026812 is a wasteful number, since it uses less digits than its factorization.
26233229026812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235518 (or 235516 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 26233229026812 in words is "twenty-six trillion, two hundred thirty-three billion, two hundred twenty-nine million, twenty-six thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •