Base | Representation |
---|---|
bin | 1001010010010011100110… |
… | …0000001011110111001101 |
3 | 1100011002001120012202122201 |
4 | 2110210321200023313031 |
5 | 2314240242103013401 |
6 | 33414242304041501 |
7 | 2102440563031462 |
oct | 224447140136715 |
9 | 40132046182581 |
10 | 10210102001101 |
11 | 3287097448162 |
12 | 118a952603291 |
13 | 590a68329432 |
14 | 274258b25669 |
15 | 12a8c51c2b01 |
hex | 9493980bdcd |
10210102001101 has 8 divisors (see below), whose sum is σ = 10277781067008. Its totient is φ = 10142546778000.
The previous prime is 10210102001093. The next prime is 10210102001131. The reversal of 10210102001101 is 10110020101201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10210102001101 - 23 = 10210102001093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210102001131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30795265 + ... + 31125046.
It is an arithmetic number, because the mean of its divisors is an integer number (1284722633376).
Almost surely, 210210102001101 is an apocalyptic number.
It is an amenable number.
10210102001101 is a deficient number, since it is larger than the sum of its proper divisors (67679065907).
10210102001101 is an equidigital number, since it uses as much as digits as its factorization.
10210102001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61921403.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10210102001101 its reverse (10110020101201), we get a palindrome (20320122102302).
It can be divided in two parts, 1021010 and 2001101, that added together give a triangular number (3022111 = T2458).
The spelling of 10210102001101 in words is "ten trillion, two hundred ten billion, one hundred two million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •