Base | Representation |
---|---|
bin | 1101111000111001000011… |
… | …1011000101101011000101 |
3 | 2000001220020001012101211211 |
4 | 3132032100323011223011 |
5 | 4000200042234133432 |
6 | 52251230300331421 |
7 | 3134203416341200 |
oct | 336162073055305 |
9 | 60056201171754 |
10 | 15271040146117 |
11 | 4958459057a38 |
12 | 1867768543b71 |
13 | 86a08c30b672 |
14 | 3ab19d7aa937 |
15 | 1b737c6aad47 |
hex | de390ec5ac5 |
15271040146117 has 12 divisors (see below), whose sum is σ = 17804371150656. Its totient is φ = 13059915643320.
The previous prime is 15271040146099. The next prime is 15271040146147. The reversal of 15271040146117 is 71164104017251.
It is not a de Polignac number, because 15271040146117 - 227 = 15270905928389 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15271040146117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15271040146147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 351732109 + ... + 351775522.
It is an arithmetic number, because the mean of its divisors is an integer number (1483697595888).
Almost surely, 215271040146117 is an apocalyptic number.
It is an amenable number.
15271040146117 is a deficient number, since it is larger than the sum of its proper divisors (2533331004539).
15271040146117 is an equidigital number, since it uses as much as digits as its factorization.
15271040146117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703508088 (or 703508081 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 40.
The spelling of 15271040146117 in words is "fifteen trillion, two hundred seventy-one billion, forty million, one hundred forty-six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •