Base | Representation |
---|---|
bin | 10010101000010101… |
… | …00111010101101110 |
3 | 221211001112102011001 |
4 | 21110022213111232 |
5 | 130441003101220 |
6 | 4332253350514 |
7 | 502600424335 |
oct | 112412472556 |
9 | 27731472131 |
10 | 10002003310 |
11 | 4272963142 |
12 | 1b3179843a |
13 | c3523c270 |
14 | 6ac524d1c |
15 | 3d815680a |
hex | 2542a756e |
10002003310 has 32 divisors (see below), whose sum is σ = 19400925600. Its totient is φ = 3690680448.
The previous prime is 10002003301. The next prime is 10002003317. The reversal of 10002003310 is 1330020001.
10002003310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×100020033102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002003317) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 185841 + ... + 233539.
It is an arithmetic number, because the mean of its divisors is an integer number (606278925).
Almost surely, 210002003310 is an apocalyptic number.
10002003310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10002003310 is a deficient number, since it is larger than the sum of its proper divisors (9398922290).
10002003310 is a wasteful number, since it uses less digits than its factorization.
10002003310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49332.
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 10002003310 its reverse (1330020001), we get a palindrome (11332023311).
The spelling of 10002003310 in words is "ten billion, two million, three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •