Base | Representation |
---|---|
bin | 1110001001001101001100… |
… | …1010000110011110010100 |
3 | 2001001200200112012020102020 |
4 | 3202103103022012132110 |
5 | 4014243103002031202 |
6 | 53024102453413140 |
7 | 3163355212051041 |
oct | 342232312063624 |
9 | 61050615166366 |
10 | 15551324252052 |
11 | 4a56309133206 |
12 | 18b1b4b03a1b0 |
13 | 88a639586b64 |
14 | 3ba98c2601c8 |
15 | 1be7d401d5bc |
hex | e24d3286794 |
15551324252052 has 36 divisors (see below), whose sum is σ = 38296751423616. Its totient is φ = 4910944499280.
The previous prime is 15551324252047. The next prime is 15551324252053. The reversal of 15551324252052 is 25025242315551.
It is a junction number, because it is equal to n+sod(n) for n = 15551324251995 and 15551324252013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15551324252053) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1794931524 + ... + 1794940187.
It is an arithmetic number, because the mean of its divisors is an integer number (1063798650656).
Almost surely, 215551324252052 is an apocalyptic number.
15551324252052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15551324252052 is an abundant number, since it is smaller than the sum of its proper divisors (22745427171564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15551324252052 is a wasteful number, since it uses less digits than its factorization.
15551324252052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3589871756 (or 3589871735 counting only the distinct ones).
The product of its (nonzero) digits is 600000, while the sum is 42.
The spelling of 15551324252052 in words is "fifteen trillion, five hundred fifty-one billion, three hundred twenty-four million, two hundred fifty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •