Base | Representation |
---|---|
bin | 1100001110011011110… |
… | …1000100101110001010 |
3 | 202002010120112001110210 |
4 | 3003212331010232022 |
5 | 11420121444400020 |
6 | 240253220221550 |
7 | 21113550512664 |
oct | 3034675045612 |
9 | 662116461423 |
10 | 210033200010 |
11 | 810902a1937 |
12 | 3485783a8b6 |
13 | 16a62b6200a |
14 | a246807534 |
15 | 56e41de3e0 |
hex | 30e6f44b8a |
210033200010 has 32 divisors (see below), whose sum is σ = 505700537472. Its totient is φ = 55828758080.
The previous prime is 210033199951. The next prime is 210033200011. The reversal of 210033200010 is 10002330012.
It is a happy number.
210033200010 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×2100332000102 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210033200011) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 11246469 + ... + 11265128.
It is an arithmetic number, because the mean of its divisors is an integer number (15803141796).
Almost surely, 2210033200010 is an apocalyptic number.
210033200010 is an abundant number, since it is smaller than the sum of its proper divisors (295667337462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210033200010 is a wasteful number, since it uses less digits than its factorization.
210033200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22511918.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 210033200010 its reverse (10002330012), we get a palindrome (220035530022).
The spelling of 210033200010 in words is "two hundred ten billion, thirty-three million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •