Base | Representation |
---|---|
bin | 111101011010… |
… | …111110101101 |
3 | 1010022000211012 |
4 | 331122332231 |
5 | 13110220133 |
6 | 1333035005 |
7 | 253600355 |
oct | 75327655 |
9 | 33260735 |
10 | 16101293 |
11 | 90a815a |
12 | 5485a65 |
13 | 34499c0 |
14 | 21d1b65 |
15 | 1630b48 |
hex | f5afad |
16101293 has 8 divisors (see below), whose sum is σ = 17938200. Its totient is φ = 14349888.
The previous prime is 16101287. The next prime is 16101301. The reversal of 16101293 is 39210161.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 77284 + 16024009 = 278^2 + 4003^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16101293 - 212 = 16097197 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 (16101223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20978 + ... + 21731.
It is an arithmetic number, because the mean of its divisors is an integer number (2242275).
Almost surely, 216101293 is an apocalyptic number.
16101293 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16101293 is a deficient number, since it is larger than the sum of its proper divisors (1836907).
16101293 is a wasteful number, since it uses less digits than its factorization.
16101293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42751.
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 16101293 is about 4012.6416485901. The cubic root of 16101293 is about 252.5148466910.
The spelling of 16101293 in words is "sixteen million, one hundred one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •