Base | Representation |
---|---|
bin | 1000111111010110… |
… | …1000001101001000 |
3 | 20020011212021100012 |
4 | 2033311220031020 |
5 | 14420234401300 |
6 | 1035243131052 |
7 | 113541602045 |
oct | 21765501510 |
9 | 6204767305 |
10 | 2413200200 |
11 | 1029209034 |
12 | 574213a88 |
13 | 2c5c5b018 |
14 | 18c6d81cc |
15 | e1cd2435 |
hex | 8fd68348 |
2413200200 has 96 divisors (see below), whose sum is σ = 5848453800. Its totient is φ = 924887040.
The previous prime is 2413200197. The next prime is 2413200217. The reversal of 2413200200 is 20023142.
It can be written as a sum of positive squares in 12 ways, for example, as 551968036 + 1861232164 = 23494^2 + 43142^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 793082 + ... + 796118.
Almost surely, 22413200200 is an apocalyptic number.
2413200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2413200200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2924226900).
2413200200 is an abundant number, since it is smaller than the sum of its proper divisors (3435253600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2413200200 is a wasteful number, since it uses less digits than its factorization.
2413200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3219 (or 3210 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 2413200200 is about 49124.3340921788. The cubic root of 2413200200 is about 1341.3160383259.
Adding to 2413200200 its reverse (20023142), we get a palindrome (2433223342).
The spelling of 2413200200 in words is "two billion, four hundred thirteen million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •