Base | Representation |
---|---|
bin | 11000011010011100… |
… | …001011010000110000 |
3 | 2111122212010120100000 |
4 | 120122130023100300 |
5 | 412141112210202 |
6 | 20013044030000 |
7 | 1615410126366 |
oct | 303234132060 |
9 | 74585116300 |
10 | 26213397552 |
11 | 10131863621 |
12 | 50b6992300 |
13 | 2619a3bb34 |
14 | 13a95a3636 |
15 | a364a791c |
hex | 61a70b430 |
26213397552 has 120 divisors (see below), whose sum is σ = 76264493760. Its totient is φ = 8716403520.
The previous prime is 26213397547. The next prime is 26213397589. The reversal of 26213397552 is 25579331262.
26213397552 is a `hidden beast` number, since 2 + 6 + 2 + 1 + 3 + 3 + 97 + 552 = 666.
It is a super-2 number, since 2×262133975522 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26213397498 and 26213397507.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1621027 + ... + 1637117.
It is an arithmetic number, because the mean of its divisors is an integer number (635537448).
Almost surely, 226213397552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26213397552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38132246880).
26213397552 is an abundant number, since it is smaller than the sum of its proper divisors (50051096208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26213397552 is a wasteful number, since it uses less digits than its factorization.
26213397552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16533 (or 16515 counting only the distinct ones).
The product of its digits is 680400, while the sum is 45.
The spelling of 26213397552 in words is "twenty-six billion, two hundred thirteen million, three hundred ninety-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •