Base | Representation |
---|---|
bin | 11101011101011010000… |
… | …01010101010001011001 |
3 | 10120202201100201221201121 |
4 | 32232231001111101121 |
5 | 113041011322402301 |
6 | 2053001342045241 |
7 | 133062521035321 |
oct | 16565501252131 |
9 | 3522640657647 |
10 | 1012220122201 |
11 | 360309963642 |
12 | 144212579821 |
13 | 745b4c11592 |
14 | 36dc53a4281 |
15 | 1b4e44b83a1 |
hex | ebad055459 |
1012220122201 has 8 divisors (see below), whose sum is σ = 1017305993984. Its totient is φ = 1007139132720.
The previous prime is 1012220122189. The next prime is 1012220122231. The reversal of 1012220122201 is 1022210222101.
It is a happy number.
1012220122201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1012220122201 - 217 = 1012219991129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012220122231) 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, 804531 + ... + 1634536.
It is an arithmetic number, because the mean of its divisors is an integer number (127163249248).
Almost surely, 21012220122201 is an apocalyptic number.
It is an amenable number.
1012220122201 is a deficient number, since it is larger than the sum of its proper divisors (5085871783).
1012220122201 is a wasteful number, since it uses less digits than its factorization.
1012220122201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2441151.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1012220122201 its reverse (1022210222101), we get a palindrome (2034430344302).
The spelling of 1012220122201 in words is "one trillion, twelve billion, two hundred twenty million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •