Base | Representation |
---|---|
bin | 10011000000000101… |
… | …11111110101101100 |
3 | 222022221121102012212 |
4 | 21200002333311230 |
5 | 131343020124400 |
6 | 4404133545552 |
7 | 510540620630 |
oct | 114002776554 |
9 | 28287542185 |
10 | 10201333100 |
11 | 4365428602 |
12 | 1b884a52b8 |
13 | c6762049a |
14 | 6cabb0dc0 |
15 | 3ea8cc335 |
hex | 2600bfd6c |
10201333100 has 36 divisors (see below), whose sum is σ = 25299307824. Its totient is φ = 3497599680.
The previous prime is 10201333063. The next prime is 10201333133. The reversal of 10201333100 is 133310201.
10201333100 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×102013331002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
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, 7285967 + ... + 7287366.
Almost surely, 210201333100 is an apocalyptic number.
10201333100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201333100 is an abundant number, since it is smaller than the sum of its proper divisors (15097974724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201333100 is a wasteful number, since it uses less digits than its factorization.
10201333100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14573354 (or 14573347 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 10201333100 its reverse (133310201), we get a palindrome (10334643301).
The spelling of 10201333100 in words is "ten billion, two hundred one million, three hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •