Base | Representation |
---|---|
bin | 10111010110000101… |
… | …10000011011011000 |
3 | 1012100110121202112102 |
4 | 23223002300123120 |
5 | 201132011144000 |
6 | 5431400102532 |
7 | 622405213661 |
oct | 135302603330 |
9 | 35313552472 |
10 | 12533303000 |
11 | 53517a5059 |
12 | 2519464a48 |
13 | 12497aa12a |
14 | 86c7a2368 |
15 | 4d54b63d5 |
hex | 2eb0b06d8 |
12533303000 has 64 divisors (see below), whose sum is σ = 29454347520. Its totient is φ = 4991712000.
The previous prime is 12533302961. The next prime is 12533303017. The reversal of 12533303000 is 30333521.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 206105 + ... + 259895.
It is an arithmetic number, because the mean of its divisors is an integer number (460224180).
Almost surely, 212533303000 is an apocalyptic number.
12533303000 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 12533303000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14727173760).
12533303000 is an abundant number, since it is smaller than the sum of its proper divisors (16921044520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12533303000 is a wasteful number, since it uses less digits than its factorization.
12533303000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54045 (or 54031 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 20.
Adding to 12533303000 its reverse (30333521), we get a palindrome (12563636521).
The spelling of 12533303000 in words is "twelve billion, five hundred thirty-three million, three hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •