Base | Representation |
---|---|
bin | 1100011010100110101… |
… | …1101100101000011010 |
3 | 202101120020221221200212 |
4 | 3012221223230220122 |
5 | 11443314322431020 |
6 | 241553323331122 |
7 | 21260530542110 |
oct | 3065153545032 |
9 | 671506857625 |
10 | 213300202010 |
11 | 82507448895 |
12 | 35409980aa2 |
13 | 1716395c8ac |
14 | a476673ab0 |
15 | 5835e24cc5 |
hex | 31a9aeca1a |
213300202010 has 16 divisors (see below), whose sum is σ = 438788987136. Its totient is φ = 73131497808.
The previous prime is 213300202007. The next prime is 213300202013. The reversal of 213300202010 is 10202003312.
It is a happy number.
213300202010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (213300202007) and next prime (213300202013).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (213300202013) 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 7 ways as a sum of consecutive naturals, for example, 1523572802 + ... + 1523572941.
It is an arithmetic number, because the mean of its divisors is an integer number (27424311696).
Almost surely, 2213300202010 is an apocalyptic number.
213300202010 is an abundant number, since it is smaller than the sum of its proper divisors (225488785126).
213300202010 is a wasteful number, since it uses less digits than its factorization.
213300202010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3047145757.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 213300202010 its reverse (10202003312), we get a palindrome (223502205322).
The spelling of 213300202010 in words is "two hundred thirteen billion, three hundred million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •