Base | Representation |
---|---|
bin | 11101011101011010001… |
… | …00101110010010011101 |
3 | 10120202201102102010001211 |
4 | 32232231010232102131 |
5 | 113041012034323401 |
6 | 2053001413104421 |
7 | 133062531430006 |
oct | 16565504562235 |
9 | 3522642363054 |
10 | 1012221011101 |
11 | 36030a410473 |
12 | 144212928111 |
13 | 745b5163061 |
14 | 36dc55561ad |
15 | 1b4e45e1951 |
hex | ebad12e49d |
1012221011101 has 4 divisors (see below), whose sum is σ = 1013031437500. Its totient is φ = 1011410584704.
The previous prime is 1012221011069. The next prime is 1012221011141. The reversal of 1012221011101 is 1011101222101.
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 616295652025 + 395925359076 = 785045^2 + 629226^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012221011101 - 25 = 1012221011069 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 (1012221011141) 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, 405211326 + ... + 405213823.
It is an arithmetic number, because the mean of its divisors is an integer number (253257859375).
Almost surely, 21012221011101 is an apocalyptic number.
It is an amenable number.
1012221011101 is a deficient number, since it is larger than the sum of its proper divisors (810426399).
1012221011101 is an equidigital number, since it uses as much as digits as its factorization.
1012221011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 810426398.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1012221011101 its reverse (1011101222101), we get a palindrome (2023322233202).
The spelling of 1012221011101 in words is "one trillion, twelve billion, two hundred twenty-one million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •