Base | Representation |
---|---|
bin | 11101111111101001… |
… | …00010101010010001 |
3 | 1112120020212102210020 |
4 | 32333310202222101 |
5 | 230434344423401 |
6 | 11221521454053 |
7 | 1110023202135 |
oct | 167764425221 |
9 | 45506772706 |
10 | 16103123601 |
11 | 6913880114 |
12 | 3154aa1329 |
13 | 1698251706 |
14 | aca9373c5 |
15 | 643ab5d36 |
hex | 3bfd22a91 |
16103123601 has 4 divisors (see below), whose sum is σ = 21470831472. Its totient is φ = 10735415732.
The previous prime is 16103123587. The next prime is 16103123657. The reversal of 16103123601 is 10632130161.
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: 10632130161 = 3 ⋅3544043387.
It is a cyclic number.
It is not a de Polignac number, because 16103123601 - 226 = 16036014737 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16103123671) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2683853931 + ... + 2683853936.
It is an arithmetic number, because the mean of its divisors is an integer number (5367707868).
Almost surely, 216103123601 is an apocalyptic number.
It is an amenable number.
16103123601 is a deficient number, since it is larger than the sum of its proper divisors (5367707871).
16103123601 is an equidigital number, since it uses as much as digits as its factorization.
16103123601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5367707870.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 16103123601 its reverse (10632130161), we get a palindrome (26735253762).
The spelling of 16103123601 in words is "sixteen billion, one hundred three million, one hundred twenty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •