Base | Representation |
---|---|
bin | 11110100010100000… |
… | …00100000101111101 |
3 | 1120022122010021220101 |
4 | 33101100010011331 |
5 | 232034230113401 |
6 | 11310525321101 |
7 | 1120203612346 |
oct | 172120040575 |
9 | 46278107811 |
10 | 16395551101 |
11 | 6a53952236 |
12 | 3216a06191 |
13 | 17139ca837 |
14 | b176d90cd |
15 | 65e5cb101 |
hex | 3d140417d |
16395551101 has 4 divisors (see below), whose sum is σ = 16399632604. Its totient is φ = 16391469600.
The previous prime is 16395551093. The next prime is 16395551177. The reversal of 16395551101 is 10115559361.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10115559361 = 5843 ⋅1731227.
It can be written as a sum of positive squares in 2 ways, for example, as 9276579225 + 7118971876 = 96315^2 + 84374^2 .
It is a cyclic number.
It is not a de Polignac number, because 16395551101 - 23 = 16395551093 is a prime.
It is a super-3 number, since 3×163955511013 (a number of 32 digits) contains 333 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 (16395551201) 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, 2034720 + ... + 2042761.
It is an arithmetic number, because the mean of its divisors is an integer number (4099908151).
Almost surely, 216395551101 is an apocalyptic number.
It is an amenable number.
16395551101 is a deficient number, since it is larger than the sum of its proper divisors (4081503).
16395551101 is an equidigital number, since it uses as much as digits as its factorization.
16395551101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4081502.
The product of its (nonzero) digits is 20250, while the sum is 37.
The spelling of 16395551101 in words is "sixteen billion, three hundred ninety-five million, five hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •