Base | Representation |
---|---|
bin | 11000100010100001… |
… | …111111101001101011 |
3 | 2112000022120000202211 |
4 | 120202201333221223 |
5 | 412430334444322 |
6 | 20034333305551 |
7 | 1621645666600 |
oct | 304241775153 |
9 | 75008500684 |
10 | 26349140587 |
11 | 101a1448350 |
12 | 51343352b7 |
13 | 263bbb8663 |
14 | 13bd61a6a7 |
15 | a4336cb77 |
hex | 62287fa6b |
26349140587 has 48 divisors (see below), whose sum is σ = 36333204480. Its totient is φ = 18823492800.
The previous prime is 26349140567. The next prime is 26349140593. The reversal of 26349140587 is 78504194362.
It is a happy number.
It is not a de Polignac number, because 26349140587 - 223 = 26340751979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a self number, because there is not a number n which added to its sum of digits gives 26349140587.
It is not an unprimeable number, because it can be changed into a prime (26349140557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 275973 + ... + 358969.
It is an arithmetic number, because the mean of its divisors is an integer number (756941760).
It is a 1-persistent number, because it is pandigital, but 2⋅26349140587 = 52698281174 is not.
Almost surely, 226349140587 is an apocalyptic number.
26349140587 is a deficient number, since it is larger than the sum of its proper divisors (9984063893).
26349140587 is a wasteful number, since it uses less digits than its factorization.
26349140587 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83072 (or 83065 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 26349140587 in words is "twenty-six billion, three hundred forty-nine million, one hundred forty thousand, five hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •