Base | Representation |
---|---|
bin | 1110100111001001010000… |
… | …0001101011101100110110 |
3 | 2002212212021112211010202211 |
4 | 3221302110001223230312 |
5 | 4101204433223444100 |
6 | 54100243550324034 |
7 | 3245464026440554 |
oct | 351622401535466 |
9 | 62785245733684 |
10 | 16065661156150 |
11 | 5134454989981 |
12 | 19757714b961a |
13 | 8c6ca6a62c28 |
14 | 3d78215b8bd4 |
15 | 1ccd886331ba |
hex | e9c9406bb36 |
16065661156150 has 24 divisors (see below), whose sum is σ = 30072461801760. Its totient is φ = 6385332838560.
The previous prime is 16065661156081. The next prime is 16065661156151. The reversal of 16065661156150 is 5165116656061.
16065661156150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 16065661156094 and 16065661156103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16065661156151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1023282670 + ... + 1023298369.
It is an arithmetic number, because the mean of its divisors is an integer number (1253019241740).
Almost surely, 216065661156150 is an apocalyptic number.
16065661156150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16065661156150 is a deficient number, since it is larger than the sum of its proper divisors (14006800645610).
16065661156150 is a wasteful number, since it uses less digits than its factorization.
16065661156150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2046581208 (or 2046581203 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 49.
The spelling of 16065661156150 in words is "sixteen trillion, sixty-five billion, six hundred sixty-one million, one hundred fifty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •