Base | Representation |
---|---|
bin | 100110101110010001110… |
… | …011111000001111100110 |
3 | 100102101120211101121000100 |
4 | 212232101303320033212 |
5 | 322044242422133022 |
6 | 5354243310324530 |
7 | 363152554512042 |
oct | 46562163701746 |
9 | 10371524347010 |
10 | 2661031052262 |
11 | 93659a724250 |
12 | 36b885ab9746 |
13 | 163c1b43bb4b |
14 | 92b1a4d9022 |
15 | 49345d651ac |
hex | 26b91cf83e6 |
2661031052262 has 48 divisors (see below), whose sum is σ = 6321316435200. Its totient is φ = 802320908400.
The previous prime is 2661031052237. The next prime is 2661031052293. The reversal of 2661031052262 is 2622501301662.
2661031052262 is a `hidden beast` number, since 2 + 6 + 61 + 0 + 3 + 10 + 522 + 62 = 666.
It is a super-2 number, since 2×26610310522622 (a number of 26 digits) contains 22 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 (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33728314 + ... + 33807117.
It is an arithmetic number, because the mean of its divisors is an integer number (131694092400).
Almost surely, 22661031052262 is an apocalyptic number.
2661031052262 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2661031052262 is an abundant number, since it is smaller than the sum of its proper divisors (3660285382938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2661031052262 is a wasteful number, since it uses less digits than its factorization.
2661031052262 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67535649 (or 67535646 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 2661031052262 in words is "two trillion, six hundred sixty-one billion, thirty-one million, fifty-two thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •