Base | Representation |
---|---|
bin | 11000011101010101… |
… | …11010000000000000 |
3 | 1020220010100110120000 |
4 | 30032222322000000 |
5 | 203343020434103 |
6 | 10010551320000 |
7 | 643253626560 |
oct | 141652720000 |
9 | 36803313500 |
10 | 13131030528 |
11 | 5629140650 |
12 | 2665680000 |
13 | 131358b565 |
14 | 8c7d16da0 |
15 | 51cbd5aa3 |
hex | 30eaba000 |
13131030528 has 560 divisors, whose sum is σ = 49098671424. Its totient is φ = 3397386240.
The previous prime is 13131030463. The next prime is 13131030569. The reversal of 13131030528 is 82503013131.
13131030528 is a `hidden beast` number, since 1 + 3 + 131 + 0 + 3 + 0 + 528 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 51093376 + ... + 51093632.
Almost surely, 213131030528 is an apocalyptic number.
13131030528 is a gapful number since it is divisible by the number (18) 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 13131030528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24549335712).
13131030528 is an abundant number, since it is smaller than the sum of its proper divisors (35967640896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13131030528 is an equidigital number, since it uses as much as digits as its factorization.
13131030528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313 (or 280 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 13131030528 its reverse (82503013131), we get a palindrome (95634043659).
The spelling of 13131030528 in words is "thirteen billion, one hundred thirty-one million, thirty thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •