Base | Representation |
---|---|
bin | 10111111011110101100100… |
… | …110011011100101011010000 |
3 | 111210201102122100002021001110 |
4 | 113323311210303130223100 |
5 | 102244143401413303224 |
6 | 1011515002425133320 |
7 | 31113202333126221 |
oct | 2773654463345320 |
9 | 453642570067043 |
10 | 105267044666064 |
11 | 305a5559453866 |
12 | b98156032a240 |
13 | 46978415caac8 |
14 | 1bdcd48995248 |
15 | c283863a6929 |
hex | 5fbd64cdcad0 |
105267044666064 has 20 divisors (see below), whose sum is σ = 271939865387456. Its totient is φ = 35089014888672.
The previous prime is 105267044666053. The next prime is 105267044666071. The reversal of 105267044666064 is 460666440762501.
It is a super-2 number, since 2×1052670446660642 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105267044665995 and 105267044666013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1096531715224 + ... + 1096531715319.
Almost surely, 2105267044666064 is an apocalyptic number.
It is an amenable number.
105267044666064 is an abundant number, since it is smaller than the sum of its proper divisors (166672820721392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105267044666064 is a wasteful number, since it uses less digits than its factorization.
105267044666064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2193063430554 (or 2193063430548 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 57.
The spelling of 105267044666064 in words is "one hundred five trillion, two hundred sixty-seven billion, forty-four million, six hundred sixty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •