Base | Representation |
---|---|
bin | 11000100101111100… |
… | …10100110100110100 |
3 | 1021002011012120121200 |
4 | 30102332110310310 |
5 | 204020011330004 |
6 | 10022051012500 |
7 | 645121413636 |
oct | 142276246464 |
9 | 37064176550 |
10 | 13203230004 |
11 | 5665974138 |
12 | 268589a130 |
13 | 132551a243 |
14 | 8d374ca56 |
15 | 5241e8239 |
hex | 312f94d34 |
13203230004 has 36 divisors (see below), whose sum is σ = 33435895584. Its totient is φ = 4393024272.
The previous prime is 13203229987. The next prime is 13203230021. The reversal of 13203230004 is 40003230231.
13203230004 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13203229987) and next prime (13203230021).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 315552 + ... + 354935.
Almost surely, 213203230004 is an apocalyptic number.
It is an amenable number.
13203230004 is an abundant number, since it is smaller than the sum of its proper divisors (20232665580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13203230004 is a wasteful number, since it uses less digits than its factorization.
13203230004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671044 (or 671039 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 13203230004 its reverse (40003230231), we get a palindrome (53206460235).
The spelling of 13203230004 in words is "thirteen billion, two hundred three million, two hundred thirty thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •