Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …111001101011110110011 |
3 | 10220021102101001110210000 |
4 | 100001211113031132303 |
5 | 121020240311223443 |
6 | 2201520115241043 |
7 | 142363031231523 |
oct | 20014527153663 |
9 | 3807371043700 |
10 | 1101212211123 |
11 | 395026648172 |
12 | 1595098a9183 |
13 | 7cac7c8686b |
14 | 3b428495683 |
15 | 1d9a20ee8d3 |
hex | 100655cd7b3 |
1101212211123 has 20 divisors (see below), whose sum is σ = 1645062411520. Its totient is φ = 734122863792.
The previous prime is 1101212211103. The next prime is 1101212211133. The reversal of 1101212211123 is 3211122121011.
It is a happy number.
It is not a de Polignac number, because 1101212211123 - 25 = 1101212211091 is a prime.
It is a super-2 number, since 2×11012122111232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101212211096 and 1101212211105.
It is not an unprimeable number, because it can be changed into a prime (1101212211103) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3530961 + ... + 3830157.
It is an arithmetic number, because the mean of its divisors is an integer number (82253120576).
Almost surely, 21101212211123 is an apocalyptic number.
1101212211123 is a deficient number, since it is larger than the sum of its proper divisors (543850200397).
1101212211123 is an equidigital number, since it uses as much as digits as its factorization.
1101212211123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344648 (or 344639 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1101212211123 its reverse (3211122121011), we get a palindrome (4312334332134).
The spelling of 1101212211123 in words is "one trillion, one hundred one billion, two hundred twelve million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •