Base | Representation |
---|---|
bin | 11101001011010011… |
… | …10001000001110101 |
3 | 1111102122202021121220 |
4 | 32211221301001311 |
5 | 224040001410003 |
6 | 11110155500553 |
7 | 1063112402346 |
oct | 164551610165 |
9 | 44378667556 |
10 | 15664091253 |
11 | 6708a75668 |
12 | 3051a57759 |
13 | 16282c4b65 |
14 | a884d20cd |
15 | 61a292353 |
hex | 3a5a71075 |
15664091253 has 8 divisors (see below), whose sum is σ = 21137087328. Its totient is φ = 10316911344.
The previous prime is 15664091251. The next prime is 15664091273. The reversal of 15664091253 is 35219046651.
15664091253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 15664091253 - 21 = 15664091251 is a prime.
It is a super-2 number, since 2×156640912532 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15664091251) 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, 31453750 + ... + 31454247.
It is an arithmetic number, because the mean of its divisors is an integer number (2642135916).
Almost surely, 215664091253 is an apocalyptic number.
It is an amenable number.
15664091253 is a deficient number, since it is larger than the sum of its proper divisors (5472996075).
15664091253 is an equidigital number, since it uses as much as digits as its factorization.
15664091253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62908083.
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 15664091253 in words is "fifteen billion, six hundred sixty-four million, ninety-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •