Base | Representation |
---|---|
bin | 1110100100000011110010… |
… | …0001101100011010011000 |
3 | 2002200210110100122111102120 |
4 | 3221000330201230122120 |
5 | 4044322403301420422 |
6 | 54020040025301240 |
7 | 3241606324252530 |
oct | 351007441543230 |
9 | 62623410574376 |
10 | 16012653545112 |
11 | 5113a23528174 |
12 | 1967439334820 |
13 | 8c1ca9b75603 |
14 | 3d50336604c0 |
15 | 1cb7d4be445c |
hex | e903c86c698 |
16012653545112 has 32 divisors (see below), whose sum is σ = 45750438700800. Its totient is φ = 4575043869984.
The previous prime is 16012653545041. The next prime is 16012653545153. The reversal of 16012653545112 is 21154535621061.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47656706812 + ... + 47656707147.
It is an arithmetic number, because the mean of its divisors is an integer number (1429701209400).
Almost surely, 216012653545112 is an apocalyptic number.
16012653545112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16012653545112 is an abundant number, since it is smaller than the sum of its proper divisors (29737785155688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16012653545112 is a wasteful number, since it uses less digits than its factorization.
16012653545112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95313413975 (or 95313413971 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 42.
The spelling of 16012653545112 in words is "sixteen trillion, twelve billion, six hundred fifty-three million, five hundred forty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •