Base | Representation |
---|---|
bin | 10011000001001000… |
… | …00110001110011010 |
3 | 222100112221020200220 |
4 | 21200210012032122 |
5 | 131402230310020 |
6 | 4405043540510 |
7 | 511004440014 |
oct | 114044061632 |
9 | 28315836626 |
10 | 10210010010 |
11 | 436a314702 |
12 | 1b8b38a736 |
13 | c6936aa55 |
14 | 6cbdcd1b4 |
15 | 3eb543240 |
hex | 26090639a |
10210010010 has 16 divisors (see below), whose sum is σ = 24504024096. Its totient is φ = 2722669328.
The previous prime is 10210010009. The next prime is 10210010011. The reversal of 10210010010 is 1001001201.
It is an interprime number because it is at equal distance from previous prime (10210010009) and next prime (10210010011).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (10210010011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170166804 + ... + 170166863.
It is an arithmetic number, because the mean of its divisors is an integer number (1531501506).
Almost surely, 210210010010 is an apocalyptic number.
10210010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10210010010 is an abundant number, since it is smaller than the sum of its proper divisors (14294014086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210010010 is a wasteful number, since it uses less digits than its factorization.
10210010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340333677.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 10210010010 its reverse (1001001201), we get a palindrome (11211011211).
The spelling of 10210010010 in words is "ten billion, two hundred ten million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •