Base | Representation |
---|---|
bin | 1111000111111111111111… |
… | …1001000100001101101010 |
3 | 2011212211020001211012122220 |
4 | 3301333333321010031222 |
5 | 4134431432024133422 |
6 | 55211433501254510 |
7 | 3334325444601060 |
oct | 361777771041552 |
9 | 64784201735586 |
10 | 16630111552362 |
11 | 5331877474a30 |
12 | 1a4703a864436 |
13 | 93829c667709 |
14 | 416c8a368030 |
15 | 1dc8c2559e5c |
hex | f1fffe4436a |
16630111552362 has 128 divisors (see below), whose sum is σ = 41546988564480. Its totient is φ = 4311214709760.
The previous prime is 16630111552231. The next prime is 16630111552381. The reversal of 16630111552362 is 26325511103661.
It is a happy number.
It is a super-2 number, since 2×166301115523622 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 621463939 + ... + 621490697.
It is an arithmetic number, because the mean of its divisors is an integer number (324585848160).
Almost surely, 216630111552362 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16630111552362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20773494282240).
16630111552362 is an abundant number, since it is smaller than the sum of its proper divisors (24916877012118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16630111552362 is a wasteful number, since it uses less digits than its factorization.
16630111552362 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29316.
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 16630111552362 in words is "sixteen trillion, six hundred thirty billion, one hundred eleven million, five hundred fifty-two thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •