Base | Representation |
---|---|
bin | 11110100001000101… |
… | …10100100101011111 |
3 | 1120021210210202001012 |
4 | 33100202310211133 |
5 | 232023211103403 |
6 | 11305423205435 |
7 | 1120001035163 |
oct | 172042644537 |
9 | 46253722035 |
10 | 16383691103 |
11 | 6a4819168a |
12 | 3212a4687b |
13 | 17114074a0 |
14 | b15cccca3 |
15 | 65d536ed8 |
hex | 3d08b495f |
16383691103 has 4 divisors (see below), whose sum is σ = 17643975048. Its totient is φ = 15123407160.
The previous prime is 16383691097. The next prime is 16383691109. The reversal of 16383691103 is 30119638361.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30119638361 = 17 ⋅1771743433.
It is an interprime number because it is at equal distance from previous prime (16383691097) and next prime (16383691109).
It is a cyclic number.
It is not a de Polignac number, because 16383691103 - 210 = 16383690079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16383691109) 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, 630141953 + ... + 630141978.
It is an arithmetic number, because the mean of its divisors is an integer number (4410993762).
Almost surely, 216383691103 is an apocalyptic number.
16383691103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
16383691103 is a deficient number, since it is larger than the sum of its proper divisors (1260283945).
16383691103 is a wasteful number, since it uses less digits than its factorization.
16383691103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1260283944.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 16383691103 in words is "sixteen billion, three hundred eighty-three million, six hundred ninety-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •