Base | Representation |
---|---|
bin | 11110000000000000… |
… | …00000000000000001 |
3 | 1112120110112001011121 |
4 | 33000000000000001 |
5 | 230441132033421 |
6 | 11222110112241 |
7 | 1110060552352 |
oct | 170000000001 |
9 | 45513461147 |
10 | 16106127361 |
11 | 6915541965 |
12 | 3155aab681 |
13 | 1698a6399c |
14 | acb0b9d29 |
15 | 643eaad41 |
hex | 3c0000001 |
16106127361 has 4 divisors (see below), whose sum is σ = 16806393792. Its totient is φ = 15405860932.
The previous prime is 16106127277. The next prime is 16106127377. The reversal of 16106127361 is 16372160161.
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, and also an emirpimes, since its reverse is a distinct semiprime: 16372160161 = 7 ⋅2338880023.
It is a cyclic number.
It is not a de Polignac number, because 16106127361 - 221 = 16104030209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16106127161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350133181 + ... + 350133226.
It is an arithmetic number, because the mean of its divisors is an integer number (4201598448).
It is a Proth number, since it is equal to 15 ⋅ 230 + 1 and 15 < 230.
Almost surely, 216106127361 is an apocalyptic number.
It is an amenable number.
16106127361 is a deficient number, since it is larger than the sum of its proper divisors (700266431).
16106127361 is an equidigital number, since it uses as much as digits as its factorization.
16106127361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700266430.
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 16106127361 in words is "sixteen billion, one hundred six million, one hundred twenty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •