Base | Representation |
---|---|
bin | 11000011111111001… |
… | …11010010000000000 |
3 | 1020221121210121122222 |
4 | 30033330322100000 |
5 | 203414021333420 |
6 | 10013040150212 |
7 | 643634431550 |
oct | 141774722000 |
9 | 36847717588 |
10 | 13152527360 |
11 | 563a293525 |
12 | 2670908368 |
13 | 1317b7708b |
14 | 8cab11160 |
15 | 51ea30225 |
hex | 30ff3a400 |
13152527360 has 176 divisors, whose sum is σ = 38180709504. Its totient is φ = 4243980288.
The previous prime is 13152527351. The next prime is 13152527363. The reversal of 13152527360 is 6372525131.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 13152527360.
It is not an unprimeable number, because it can be changed into a prime (13152527363) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 598487 + ... + 620073.
Almost surely, 213152527360 is an apocalyptic number.
13152527360 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 13152527360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19090354752).
13152527360 is an abundant number, since it is smaller than the sum of its proper divisors (25028182144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13152527360 is a wasteful number, since it uses less digits than its factorization.
13152527360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21636 (or 21618 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 35.
The spelling of 13152527360 in words is "thirteen billion, one hundred fifty-two million, five hundred twenty-seven thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •