Base | Representation |
---|---|
bin | 10011000010011110… |
… | …10001111101111100 |
3 | 222101100020101012220 |
4 | 21201033101331330 |
5 | 131413130032200 |
6 | 4410130325340 |
7 | 511202605536 |
oct | 114117217574 |
9 | 28340211186 |
10 | 10221330300 |
11 | 4375746815 |
12 | 1b93129850 |
13 | c6b80254c |
14 | 6cd6d8856 |
15 | 3ec52c4a0 |
hex | 2613d1f7c |
10221330300 has 36 divisors (see below), whose sum is σ = 29573716536. Its totient is φ = 2725688000.
The previous prime is 10221330247. The next prime is 10221330313. The reversal of 10221330300 is 303312201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10221330300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17035251 + ... + 17035850.
It is an arithmetic number, because the mean of its divisors is an integer number (821492126).
Almost surely, 210221330300 is an apocalyptic number.
10221330300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221330300 is an abundant number, since it is smaller than the sum of its proper divisors (19352386236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221330300 is a wasteful number, since it uses less digits than its factorization.
10221330300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34071118 (or 34071111 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10221330300 its reverse (303312201), we get a palindrome (10524642501).
The spelling of 10221330300 in words is "ten billion, two hundred twenty-one million, three hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •