Base | Representation |
---|---|
bin | 10000000001101011010… |
… | …000000100000110111110 |
3 | 10220021200020221112001011 |
4 | 100001223100010012332 |
5 | 121020441104013042 |
6 | 2201534004505434 |
7 | 142365341023651 |
oct | 20015320040676 |
9 | 3807606845034 |
10 | 1101311001022 |
11 | 395077392511 |
12 | 1595369ab27a |
13 | 7cb1259561b |
14 | 3b43764d898 |
15 | 1d9aab15a17 |
hex | 1006b4041be |
1101311001022 has 16 divisors (see below), whose sum is σ = 1656253957392. Its totient is φ = 549226560960.
The previous prime is 1101311001019. The next prime is 1101311001029. The reversal of 1101311001022 is 2201001131011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1101311000993 and 1101311001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101311001029) 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, 12127578 + ... + 12218050.
It is an arithmetic number, because the mean of its divisors is an integer number (103515872337).
Almost surely, 21101311001022 is an apocalyptic number.
1101311001022 is a deficient number, since it is larger than the sum of its proper divisors (554942956370).
1101311001022 is a wasteful number, since it uses less digits than its factorization.
1101311001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106203.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1101311001022 its reverse (2201001131011), we get a palindrome (3302312132033).
The spelling of 1101311001022 in words is "one trillion, one hundred one billion, three hundred eleven million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •