Base | Representation |
---|---|
bin | 11101001011010100… |
… | …01110000010001001 |
3 | 1111102122222022121001 |
4 | 32211222032002021 |
5 | 224040014210212 |
6 | 11110202215001 |
7 | 1063113405616 |
oct | 164552160211 |
9 | 44378868531 |
10 | 15664210057 |
11 | 6709046951 |
12 | 3051ab4461 |
13 | 1628336c62 |
14 | a8852350d |
15 | 61a2b7657 |
hex | 3a5a8e089 |
15664210057 has 8 divisors (see below), whose sum is σ = 16677270792. Its totient is φ = 14661331200.
The previous prime is 15664210021. The next prime is 15664210087. The reversal of 15664210057 is 75001246651.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3568389696 + 12095820361 = 59736^2 + 109981^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 15664210057 - 27 = 15664209929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15664209998 and 15664210025.
It is not an unprimeable number, because it can be changed into a prime (15664210087) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2542294 + ... + 2548447.
It is an arithmetic number, because the mean of its divisors is an integer number (2084658849).
Almost surely, 215664210057 is an apocalyptic number.
15664210057 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
15664210057 is a deficient number, since it is larger than the sum of its proper divisors (1013060735).
15664210057 is a wasteful number, since it uses less digits than its factorization.
15664210057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5090939.
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 15664210057 in words is "fifteen billion, six hundred sixty-four million, two hundred ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •