Base | Representation |
---|---|
bin | 1110101100101001010010… |
… | …0110010111000101100011 |
3 | 2010012220012100011102011220 |
4 | 3223022110212113011203 |
5 | 4104232001433122210 |
6 | 54211513001510123 |
7 | 3255350555004342 |
oct | 353122446270543 |
9 | 63186170142156 |
10 | 16160160051555 |
11 | 5170538066743 |
12 | 198bb44aa2343 |
13 | 902b86962ca0 |
14 | 3dc227bb5b59 |
15 | 1d0569930c70 |
hex | eb294997163 |
16160160051555 has 16 divisors (see below), whose sum is σ = 27845198858400. Its totient is φ = 7955771102208.
The previous prime is 16160160051551. The next prime is 16160160051571. The reversal of 16160160051555 is 55515006106161.
16160160051555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16160160051555 - 22 = 16160160051551 is a prime.
It is a super-2 number, since 2×161601600515552 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16160160051551) 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, 41436307630 + ... + 41436308019.
It is an arithmetic number, because the mean of its divisors is an integer number (1740324928650).
Almost surely, 216160160051555 is an apocalyptic number.
16160160051555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16160160051555 is a deficient number, since it is larger than the sum of its proper divisors (11685038806845).
16160160051555 is a wasteful number, since it uses less digits than its factorization.
16160160051555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82872615670.
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 16160160051555 in words is "sixteen trillion, one hundred sixty billion, one hundred sixty million, fifty-one thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •