Base | Representation |
---|---|
bin | 10010101000011101… |
… | …00101011111011000 |
3 | 221211010111022010200 |
4 | 21110032211133120 |
5 | 130441234404222 |
6 | 4332331542200 |
7 | 502612321332 |
oct | 112416453730 |
9 | 27733438120 |
10 | 10003044312 |
11 | 4273504278 |
12 | 1b31bba960 |
13 | c35515041 |
14 | 6ac716452 |
15 | 3d82aeeac |
hex | 2543a57d8 |
10003044312 has 24 divisors (see below), whose sum is σ = 27091578540. Its totient is φ = 3334348080.
The previous prime is 10003044301. The next prime is 10003044347. The reversal of 10003044312 is 21344030001.
10003044312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
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 5 ways as a sum of consecutive naturals, for example, 69465514 + ... + 69465657.
Almost surely, 210003044312 is an apocalyptic number.
10003044312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10003044312 is an abundant number, since it is smaller than the sum of its proper divisors (17088534228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10003044312 is a wasteful number, since it uses less digits than its factorization.
10003044312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138931183 (or 138931176 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10003044312 its reverse (21344030001), we get a palindrome (31347074313).
The spelling of 10003044312 in words is "ten billion, three million, forty-four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •