Base | Representation |
---|---|
bin | 11000010011111000… |
… | …110010001000110010 |
3 | 2111101012020222022000 |
4 | 120103320302020302 |
5 | 411424441100211 |
6 | 15554115354430 |
7 | 1612603501104 |
oct | 302370621062 |
9 | 74335228260 |
10 | 26103456306 |
11 | 100857a2094 |
12 | 5085bb2a16 |
13 | 2600027445 |
14 | 1398b45574 |
15 | a2b9dc656 |
hex | 613e32232 |
26103456306 has 64 divisors (see below), whose sum is σ = 59470588800. Its totient is φ = 8482060800.
The previous prime is 26103456283. The next prime is 26103456319. The reversal of 26103456306 is 60365430162.
26103456306 is a `hidden beast` number, since 2 + 6 + 1 + 0 + 345 + 6 + 306 = 666.
It is a super-2 number, since 2×261034563062 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3226186 + ... + 3234266.
It is an arithmetic number, because the mean of its divisors is an integer number (929227950).
Almost surely, 226103456306 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26103456306, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29735294400).
26103456306 is an abundant number, since it is smaller than the sum of its proper divisors (33367132494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26103456306 is a wasteful number, since it uses less digits than its factorization.
26103456306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9592 (or 9586 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
Adding to 26103456306 its reverse (60365430162), we get a palindrome (86468886468).
The spelling of 26103456306 in words is "twenty-six billion, one hundred three million, four hundred fifty-six thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •