Base | Representation |
---|---|
bin | 11000010100110101… |
… | …101001010000000010 |
3 | 2111102022021112121010 |
4 | 120110311221100002 |
5 | 411443032120230 |
6 | 15555445341350 |
7 | 1613156220252 |
oct | 302465512002 |
9 | 74368245533 |
10 | 26119410690 |
11 | 100937a992a |
12 | 508b407856 |
13 | 26034222c9 |
14 | 139acd9962 |
15 | a2d0de9b0 |
hex | 614d69402 |
26119410690 has 32 divisors (see below), whose sum is σ = 62693427456. Its totient is φ = 6964416000.
The previous prime is 26119410683. The next prime is 26119410697. The reversal of 26119410690 is 9601491162.
26119410690 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (26119410683) and next prime (26119410697).
It is a super-2 number, since 2×261194106902 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (26119410697) 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 15 ways as a sum of consecutive naturals, for example, 265815 + ... + 350565.
It is an arithmetic number, because the mean of its divisors is an integer number (1959169608).
Almost surely, 226119410690 is an apocalyptic number.
26119410690 is an abundant number, since it is smaller than the sum of its proper divisors (36574016766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26119410690 is a wasteful number, since it uses less digits than its factorization.
26119410690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95034.
The product of its (nonzero) digits is 23328, while the sum is 39.
The spelling of 26119410690 in words is "twenty-six billion, one hundred nineteen million, four hundred ten thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •