Base | Representation |
---|---|
bin | 10001100111110101111… |
… | …100001101100001000101 |
3 | 11021202211111202021201111 |
4 | 101213311330031201011 |
5 | 124320123033341401 |
6 | 2324155314125021 |
7 | 153331002155413 |
oct | 21476574154105 |
9 | 4252744667644 |
10 | 1211012012101 |
11 | 427650789841 |
12 | 176851580771 |
13 | 8a275b599b8 |
14 | 42882c442b3 |
15 | 2177b84de51 |
hex | 119f5f0d845 |
1211012012101 has 4 divisors (see below), whose sum is σ = 1211050067500. Its totient is φ = 1210973956704.
The previous prime is 1211012012083. The next prime is 1211012012113. The reversal of 1211012012101 is 1012102101121.
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 203897402500 + 1007114609601 = 451550^2 + 1003551^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211012012101 - 27 = 1211012011973 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 (1211012012201) 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, 18979926 + ... + 19043623.
It is an arithmetic number, because the mean of its divisors is an integer number (302762516875).
Almost surely, 21211012012101 is an apocalyptic number.
It is an amenable number.
1211012012101 is a deficient number, since it is larger than the sum of its proper divisors (38055399).
1211012012101 is an equidigital number, since it uses as much as digits as its factorization.
1211012012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38055398.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1211012012101 its reverse (1012102101121), we get a palindrome (2223114113222).
The spelling of 1211012012101 in words is "one trillion, two hundred eleven billion, twelve million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •