Base | Representation |
---|---|
bin | 1001010010010011111101… |
… | …0110011100001110110001 |
3 | 1100011002022101211012202200 |
4 | 2110210333112130032301 |
5 | 2314240442212010001 |
6 | 33414300130533413 |
7 | 2102443163656323 |
oct | 224447726341661 |
9 | 40132271735680 |
10 | 10210200110001 |
11 | 32871378678a1 |
12 | 118a97b437269 |
13 | 590a8275a238 |
14 | 274267b83613 |
15 | 12a8cdb02086 |
hex | 9493f59c3b1 |
10210200110001 has 12 divisors (see below), whose sum is σ = 15223810917120. Its totient is φ = 6587225877240.
The previous prime is 10210200109987. The next prime is 10210200110051. The reversal of 10210200110001 is 10001100201201.
It is a happy number.
It is not a de Polignac number, because 10210200110001 - 26 = 10210200109937 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10210200110051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18297849381 + ... + 18297849938.
It is an arithmetic number, because the mean of its divisors is an integer number (1268650909760).
Almost surely, 210210200110001 is an apocalyptic number.
It is an amenable number.
10210200110001 is a deficient number, since it is larger than the sum of its proper divisors (5013610807119).
10210200110001 is a wasteful number, since it uses less digits than its factorization.
10210200110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36595699356 (or 36595699353 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10210200110001 its reverse (10001100201201), we get a palindrome (20211300311202).
The spelling of 10210200110001 in words is "ten trillion, two hundred ten billion, two hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •