Base | Representation |
---|---|
bin | 11000110101010011… |
… | …01010011010110000 |
3 | 1021102010120100120120 |
4 | 30122221222122300 |
5 | 204300444444102 |
6 | 10042531410240 |
7 | 651244252326 |
oct | 143251523260 |
9 | 37363510516 |
10 | 13332031152 |
11 | 5721647370 |
12 | 2700a53980 |
13 | 134610613b |
14 | 9068b9d16 |
15 | 53068b6bc |
hex | 31aa6a6b0 |
13332031152 has 160 divisors (see below), whose sum is σ = 38341831680. Its totient is φ = 3958056960.
The previous prime is 13332031103. The next prime is 13332031171. The reversal of 13332031152 is 25113023331.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 5713378 + ... + 5715710.
It is an arithmetic number, because the mean of its divisors is an integer number (239636448).
Almost surely, 213332031152 is an apocalyptic number.
13332031152 is a gapful number since it is divisible by the number (12) 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 13332031152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19170915840).
13332031152 is an abundant number, since it is smaller than the sum of its proper divisors (25009800528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13332031152 is a wasteful number, since it uses less digits than its factorization.
13332031152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2571 (or 2565 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 13332031152 its reverse (25113023331), we get a palindrome (38445054483).
The spelling of 13332031152 in words is "thirteen billion, three hundred thirty-two million, thirty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •