Base | Representation |
---|---|
bin | 1011110100010110001… |
… | …1001000010111000100 |
3 | 201102001112022212202110 |
4 | 2331011203020113010 |
5 | 11311301224100400 |
6 | 233134255541020 |
7 | 20445165035115 |
oct | 2750543102704 |
9 | 642045285673 |
10 | 203030300100 |
11 | 79117347551 |
12 | 3342252a770 |
13 | 161b8082164 |
14 | 9b8073420c |
15 | 5434500e50 |
hex | 2f458c85c4 |
203030300100 has 72 divisors (see below), whose sum is σ = 590952051648. Its totient is φ = 53817200000.
The previous prime is 203030300071. The next prime is 203030300101. The reversal of 203030300100 is 1003030302.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (203030300101) 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 23 ways as a sum of consecutive naturals, for example, 1976151 + ... + 2076350.
It is an arithmetic number, because the mean of its divisors is an integer number (8207667384).
Almost surely, 2203030300100 is an apocalyptic number.
203030300100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203030300100 is an abundant number, since it is smaller than the sum of its proper divisors (387921751548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203030300100 is a wasteful number, since it uses less digits than its factorization.
203030300100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4052685 (or 4052678 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 12.
Adding to 203030300100 its reverse (1003030302), we get a palindrome (204033330402).
The spelling of 203030300100 in words is "two hundred three billion, thirty million, three hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •