Base | Representation |
---|---|
bin | 1100010000111000001100… |
… | …11001010010010111110000 |
3 | 10112111010122201011212212100 |
4 | 12020130012121102113300 |
5 | 12013321341434144403 |
6 | 133205005004100400 |
7 | 5452250210536011 |
oct | 610340631222760 |
9 | 115433581155770 |
10 | 26968206943728 |
11 | 865817483a666 |
12 | 3036751b34700 |
13 | 1208124c1891b |
14 | 6933a7c5d008 |
15 | 31b7893252a3 |
hex | 1887066525f0 |
26968206943728 has 30 divisors (see below), whose sum is σ = 75473523599864. Its totient is φ = 8989402314528.
The previous prime is 26968206943703. The next prime is 26968206943739. The reversal of 26968206943728 is 82734960286962.
26968206943728 is a `hidden beast` number, since 2 + 6 + 96 + 8 + 20 + 69 + 437 + 28 = 666.
It is a super-2 number, since 2×269682069437282 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 93639607300 + ... + 93639607587.
Almost surely, 226968206943728 is an apocalyptic number.
It is an amenable number.
26968206943728 is an abundant number, since it is smaller than the sum of its proper divisors (48505316656136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26968206943728 is a wasteful number, since it uses less digits than its factorization.
26968206943728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187279214901 (or 187279214892 counting only the distinct ones).
The product of its (nonzero) digits is 752467968, while the sum is 72.
The spelling of 26968206943728 in words is "twenty-six trillion, nine hundred sixty-eight billion, two hundred six million, nine hundred forty-three thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •