Base | Representation |
---|---|
bin | 1111000110111101011111… |
… | …1110011100100101000000 |
3 | 2011211010011002202020221020 |
4 | 3301233113332130211000 |
5 | 4134133403033130211 |
6 | 55155322351425440 |
7 | 3333124224132414 |
oct | 361572776344500 |
9 | 64733132666836 |
10 | 16612262005056 |
11 | 5325247903943 |
12 | 1a43698b25280 |
13 | 9366b66640c3 |
14 | 416075902d44 |
15 | 1dc1ca4c0306 |
hex | f1bd7f9c940 |
16612262005056 has 56 divisors (see below), whose sum is σ = 45468906796320. Its totient is φ = 5346475126272.
The previous prime is 16612262005013. The next prime is 16612262005117. The reversal of 16612262005056 is 65050026221661.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 16612262004999 and 16612262005017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1491756466 + ... + 1491767601.
It is an arithmetic number, because the mean of its divisors is an integer number (811944764220).
Almost surely, 216612262005056 is an apocalyptic number.
16612262005056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
16612262005056 is an abundant number, since it is smaller than the sum of its proper divisors (28856644791264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16612262005056 is a wasteful number, since it uses less digits than its factorization.
16612262005056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2983524111 (or 2983524101 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 16612262005056 in words is "sixteen trillion, six hundred twelve billion, two hundred sixty-two million, five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •