Base | Representation |
---|---|
bin | 11000101010001001… |
… | …110101110010000100 |
3 | 2112100020012022011202 |
4 | 120222021311302010 |
5 | 413211104321221 |
6 | 20055142322032 |
7 | 1625061003620 |
oct | 305211656204 |
9 | 75306168152 |
10 | 26477026436 |
11 | 10257655933 |
12 | 516b129318 |
13 | 265c543a63 |
14 | 13d25ca180 |
15 | a4e6ced0b |
hex | 62a275c84 |
26477026436 has 48 divisors (see below), whose sum is σ = 54444096000. Its totient is φ = 11031247488.
The previous prime is 26477026423. The next prime is 26477026439. The reversal of 26477026436 is 63462077462.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is not an unprimeable number, because it can be changed into a prime (26477026439) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128570 + ... + 263598.
It is an arithmetic number, because the mean of its divisors is an integer number (1134252000).
Almost surely, 226477026436 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 26477026436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27222048000).
26477026436 is an abundant number, since it is smaller than the sum of its proper divisors (27967069564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26477026436 is a wasteful number, since it uses less digits than its factorization.
26477026436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135236 (or 135234 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 47.
It can be divided in two parts, 26477026 and 436, that added together give a palindrome (26477462).
The spelling of 26477026436 in words is "twenty-six billion, four hundred seventy-seven million, twenty-six thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •