Base | Representation |
---|---|
bin | 11110000010010010… |
… | …01111000100001101 |
3 | 1112121210122102011210 |
4 | 33001021033010031 |
5 | 231011040404311 |
6 | 11224033405033 |
7 | 1110413002011 |
oct | 170111170415 |
9 | 45553572153 |
10 | 16125325581 |
11 | 6925364862 |
12 | 3160409779 |
13 | 169ca26191 |
14 | acd876541 |
15 | 6459ee3a6 |
hex | 3c124f10d |
16125325581 has 4 divisors (see below), whose sum is σ = 21500434112. Its totient is φ = 10750217052.
The previous prime is 16125325549. The next prime is 16125325597. The reversal of 16125325581 is 18552352161.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 16125325581 - 25 = 16125325549 is a prime.
It is a super-2 number, since 2×161253255812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16125325481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2687554261 + ... + 2687554266.
It is an arithmetic number, because the mean of its divisors is an integer number (5375108528).
Almost surely, 216125325581 is an apocalyptic number.
It is an amenable number.
16125325581 is a deficient number, since it is larger than the sum of its proper divisors (5375108531).
16125325581 is an equidigital number, since it uses as much as digits as its factorization.
16125325581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5375108530.
The product of its digits is 72000, while the sum is 39.
The spelling of 16125325581 in words is "sixteen billion, one hundred twenty-five million, three hundred twenty-five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •