Base | Representation |
---|---|
bin | 11000011111000000… |
… | …10100100111000000 |
3 | 1020221002200212112201 |
4 | 30033200110213000 |
5 | 203410112030102 |
6 | 10012211402544 |
7 | 643513636546 |
oct | 141740244700 |
9 | 36832625481 |
10 | 13145033152 |
11 | 5636034a69 |
12 | 266a2b3454 |
13 | 1316451c34 |
14 | 8c9b1dd96 |
15 | 51e04e987 |
hex | 30f8149c0 |
13145033152 has 56 divisors (see below), whose sum is σ = 26499202272. Its totient is φ = 6468403200.
The previous prime is 13145033147. The next prime is 13145033189. The reversal of 13145033152 is 25133054131.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 13145033152.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2910448 + ... + 2914960.
Almost surely, 213145033152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13145033152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13249601136).
13145033152 is an abundant number, since it is smaller than the sum of its proper divisors (13354169120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13145033152 is an equidigital number, since it uses as much as digits as its factorization.
13145033152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5237 (or 5227 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 13145033152 its reverse (25133054131), we get a palindrome (38278087283).
The spelling of 13145033152 in words is "thirteen billion, one hundred forty-five million, thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •