Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …0111101100010101001101 |
3 | 1100011021110212002002221220 |
4 | 2110212312213230111031 |
5 | 2314304041441333401 |
6 | 33415230451313553 |
7 | 2102543602202040 |
oct | 224466647542515 |
9 | 40137425062856 |
10 | 10212201121101 |
11 | 3287a74335081 |
12 | 118b2395ab8b9 |
13 | 591011199885 |
14 | 2743b7822c57 |
15 | 12a999614336 |
hex | 949b69ec54d |
10212201121101 has 8 divisors (see below), whose sum is σ = 15561449327424. Its totient is φ = 5835543497760.
The previous prime is 10212201121063. The next prime is 10212201121103. The reversal of 10212201121101 is 10112110221201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10212201121101 - 222 = 10212196926797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212201121103) 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 7 ways as a sum of consecutive naturals, for example, 243147645720 + ... + 243147645761.
It is an arithmetic number, because the mean of its divisors is an integer number (1945181165928).
Almost surely, 210212201121101 is an apocalyptic number.
It is an amenable number.
10212201121101 is a deficient number, since it is larger than the sum of its proper divisors (5349248206323).
10212201121101 is an equidigital number, since it uses as much as digits as its factorization.
10212201121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486295291491.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10212201121101 its reverse (10112110221201), we get a palindrome (20324311342302).
The spelling of 10212201121101 in words is "ten trillion, two hundred twelve billion, two hundred one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •