Base | Representation |
---|---|
bin | 11101011001101010101… |
… | …01011010101000001101 |
3 | 10120120112102022221001111 |
4 | 32230311111122220031 |
5 | 113022403300333401 |
6 | 2052030211412021 |
7 | 132661666230601 |
oct | 16546525325015 |
9 | 3516472287044 |
10 | 1010212121101 |
11 | 35a4794516a7 |
12 | 143951bb4011 |
13 | 74354bc5451 |
14 | 36c74825501 |
15 | 1b428074e51 |
hex | eb3555aa0d |
1010212121101 has 4 divisors (see below), whose sum is σ = 1010440628604. Its totient is φ = 1009983613600.
The previous prime is 1010212121071. The next prime is 1010212121117. The reversal of 1010212121101 is 1011212120101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 710225877001 + 299986244100 = 842749^2 + 547710^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010212121101 - 219 = 1010211596813 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 (1010212121161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114247120 + ... + 114255961.
It is an arithmetic number, because the mean of its divisors is an integer number (252610157151).
Almost surely, 21010212121101 is an apocalyptic number.
It is an amenable number.
1010212121101 is a deficient number, since it is larger than the sum of its proper divisors (228507503).
1010212121101 is an equidigital number, since it uses as much as digits as its factorization.
1010212121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228507502.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1010212121101 its reverse (1011212120101), we get a palindrome (2021424241202).
The spelling of 1010212121101 in words is "one trillion, ten billion, two hundred twelve million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •