Base | Representation |
---|---|
bin | 10010110001101100… |
… | …001010110100111001 |
3 | 1221001001111200102212 |
4 | 102301230022310321 |
5 | 312242204440342 |
6 | 13132320304505 |
7 | 1312415541446 |
oct | 226154126471 |
9 | 57031450385 |
10 | 20161015097 |
11 | 8606405053 |
12 | 3aa7a72135 |
13 | 1b93b62442 |
14 | d9383a9cd |
15 | 7cee74182 |
hex | 4b1b0ad39 |
20161015097 has 4 divisors (see below), whose sum is σ = 20437193460. Its totient is φ = 19884836736.
The previous prime is 20161015031. The next prime is 20161015129. The reversal of 20161015097 is 79051016102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4016517376 + 16144497721 = 63376^2 + 127061^2 .
It is a cyclic number.
It is not a de Polignac number, because 20161015097 - 210 = 20161014073 is a prime.
It is a super-3 number, since 3×201610150973 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20161015997) 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 3 ways as a sum of consecutive naturals, for example, 138089072 + ... + 138089217.
It is an arithmetic number, because the mean of its divisors is an integer number (5109298365).
Almost surely, 220161015097 is an apocalyptic number.
It is an amenable number.
20161015097 is a deficient number, since it is larger than the sum of its proper divisors (276178363).
20161015097 is an equidigital number, since it uses as much as digits as its factorization.
20161015097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276178362.
The product of its (nonzero) digits is 3780, while the sum is 32.
The spelling of 20161015097 in words is "twenty billion, one hundred sixty-one million, fifteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •