Base | Representation |
---|---|
bin | 11100010100100001… |
… | …10010110100001100 |
3 | 1110020122001200110001 |
4 | 32022100302310030 |
5 | 222114331411030 |
6 | 10552422254044 |
7 | 1045532425450 |
oct | 161220626414 |
9 | 43218050401 |
10 | 15204560140 |
11 | 64a263a090 |
12 | 2b43b87324 |
13 | 158403bb63 |
14 | a43472660 |
15 | 5dec6ecca |
hex | 38a432d0c |
15204560140 has 96 divisors (see below), whose sum is σ = 39851481600. Its totient is φ = 4733944320.
The previous prime is 15204560123. The next prime is 15204560153. The reversal of 15204560140 is 4106540251.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 15204560099 and 15204560108.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1564416 + ... + 1574104.
It is an arithmetic number, because the mean of its divisors is an integer number (415119600).
Almost surely, 215204560140 is an apocalyptic number.
15204560140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15204560140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19925740800).
15204560140 is an abundant number, since it is smaller than the sum of its proper divisors (24646921460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15204560140 is a wasteful number, since it uses less digits than its factorization.
15204560140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10735 (or 10733 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The spelling of 15204560140 in words is "fifteen billion, two hundred four million, five hundred sixty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •