Base | Representation |
---|---|
bin | 1100000001100001100010… |
… | …01101111001100000010100 |
3 | 10110121200220222011221021100 |
4 | 12000300301031321200110 |
5 | 11431200414431314142 |
6 | 132122355255550100 |
7 | 5366162550112401 |
oct | 600606115714024 |
9 | 113550828157240 |
10 | 26440644401172 |
11 | 8474461504a81 |
12 | 2b7045a38b330 |
13 | 119a45a6a7b91 |
14 | 675a3c2012a8 |
15 | 30cbada8cb4c |
hex | 180c31379814 |
26440644401172 has 108 divisors (see below), whose sum is σ = 69167498239840. Its totient is φ = 8511852311424.
The previous prime is 26440644401137. The next prime is 26440644401189. The reversal of 26440644401172 is 27110444604462.
It is a super-3 number, since 3×264406444011723 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 11183529 + ... + 13339887.
Almost surely, 226440644401172 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26440644401172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34583749119920).
26440644401172 is an abundant number, since it is smaller than the sum of its proper divisors (42726853838668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26440644401172 is a wasteful number, since it uses less digits than its factorization.
26440644401172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2156590 (or 2156496 counting only the distinct ones).
The product of its (nonzero) digits is 1032192, while the sum is 45.
The spelling of 26440644401172 in words is "twenty-six trillion, four hundred forty billion, six hundred forty-four million, four hundred one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •