Base | Representation |
---|---|
bin | 1100010000110111110100… |
… | …00111010100010001111011 |
3 | 10112111010010100111002201211 |
4 | 12020123322013110101323 |
5 | 12013320431213000423 |
6 | 133204532324023551 |
7 | 5452242126334666 |
oct | 610337207242173 |
9 | 115433110432654 |
10 | 26968000906363 |
11 | 8658079503750 |
12 | 30366b4b31bb7 |
13 | 12080c132961a |
14 | 6933887486dd |
15 | 31b7761c710d |
hex | 1886fa1d447b |
26968000906363 has 8 divisors (see below), whose sum is σ = 29481056225280. Its totient is φ = 24465182066280.
The previous prime is 26968000906349. The next prime is 26968000906367. The reversal of 26968000906363 is 36360900086962.
It is a happy number.
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 26968000906363 - 217 = 26968000775291 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26968000906298 and 26968000906307.
It is not an unprimeable number, because it can be changed into a prime (26968000906367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2559114195 + ... + 2559124732.
It is an arithmetic number, because the mean of its divisors is an integer number (3685132028160).
Almost surely, 226968000906363 is an apocalyptic number.
26968000906363 is a deficient number, since it is larger than the sum of its proper divisors (2513055318917).
26968000906363 is a wasteful number, since it uses less digits than its factorization.
26968000906363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5118239417.
The product of its (nonzero) digits is 15116544, while the sum is 58.
The spelling of 26968000906363 in words is "twenty-six trillion, nine hundred sixty-eight billion, nine hundred six thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •