Base | Representation |
---|---|
bin | 11000110100001010… |
… | …110010111011110000 |
3 | 2112202221100201220100 |
4 | 120310022302323300 |
5 | 414032113032242 |
6 | 20123543512400 |
7 | 1632201115545 |
oct | 306412627360 |
9 | 75687321810 |
10 | 26645049072 |
11 | 10333487814 |
12 | 51b7458700 |
13 | 26882b3035 |
14 | 140aa46bcc |
15 | a5e31e54c |
hex | 6342b2ef0 |
26645049072 has 240 divisors, whose sum is σ = 79457517568. Its totient is φ = 8321564160.
The previous prime is 26645049049. The next prime is 26645049107. The reversal of 26645049072 is 27094054662.
It is a super-2 number, since 2×266450490722 (a number of 22 digits) contains 22 as substring.
It is a congruent 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 47 ways as a sum of consecutive naturals, for example, 24377358 + ... + 24378450.
Almost surely, 226645049072 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 26645049072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39728758784).
26645049072 is an abundant number, since it is smaller than the sum of its proper divisors (52812468496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26645049072 is a wasteful number, since it uses less digits than its factorization.
26645049072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308 (or 1299 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 26645049072 in words is "twenty-six billion, six hundred forty-five million, forty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •