Base | Representation |
---|---|
bin | 11000110011100001… |
… | …001000000010001101 |
3 | 2112202011210202111212 |
4 | 120303201020002031 |
5 | 414021314003303 |
6 | 20122513424205 |
7 | 1632006221345 |
oct | 306341100215 |
9 | 75664722455 |
10 | 26634125453 |
11 | 103282a6731 |
12 | 51b386b065 |
13 | 2685c59c60 |
14 | 1409401d25 |
15 | a5d3b2ad8 |
hex | 63384808d |
26634125453 has 8 divisors (see below), whose sum is σ = 28833079296. Its totient is φ = 24456625200.
The previous prime is 26634125443. The next prime is 26634125459. The reversal of 26634125453 is 35452143662.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26634125453 - 214 = 26634109069 is a prime.
It is a super-2 number, since 2×266341254532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26634125453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26634125459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5360813 + ... + 5365778.
It is an arithmetic number, because the mean of its divisors is an integer number (3604134912).
Almost surely, 226634125453 is an apocalyptic number.
It is an amenable number.
26634125453 is a deficient number, since it is larger than the sum of its proper divisors (2198953843).
26634125453 is a wasteful number, since it uses less digits than its factorization.
26634125453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10726795.
The product of its digits is 518400, while the sum is 41.
The spelling of 26634125453 in words is "twenty-six billion, six hundred thirty-four million, one hundred twenty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •