Base | Representation |
---|---|
bin | 1110101111111001110111… |
… | …1100100110011111011100 |
3 | 2010102020201110212020120120 |
4 | 3223332131330212133130 |
5 | 4111141134232422422 |
6 | 54253332551514540 |
7 | 3262402231026630 |
oct | 353763574463734 |
9 | 63366643766516 |
10 | 16216151451612 |
11 | 519225a816292 |
12 | 199a970388a50 |
13 | 90823aa7a238 |
14 | 400c1a116dc0 |
15 | 1d1c452b045c |
hex | ebf9df267dc |
16216151451612 has 48 divisors (see below), whose sum is σ = 45519021623040. Its totient is φ = 4389334227072.
The previous prime is 16216151451611. The next prime is 16216151451677. The reversal of 16216151451612 is 21615415161261.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16216151451611) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5080246353 + ... + 5080249544.
It is an arithmetic number, because the mean of its divisors is an integer number (948312950480).
Almost surely, 216216151451612 is an apocalyptic number.
16216151451612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16216151451612 is an abundant number, since it is smaller than the sum of its proper divisors (29302870171428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16216151451612 is a wasteful number, since it uses less digits than its factorization.
16216151451612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10160495930 (or 10160495928 counting only the distinct ones).
The product of its digits is 86400, while the sum is 42.
The spelling of 16216151451612 in words is "sixteen trillion, two hundred sixteen billion, one hundred fifty-one million, four hundred fifty-one thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •