Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …010110001010011110011 |
3 | 10220100202201111110100200 |
4 | 100002123202301103303 |
5 | 121024121012223443 |
6 | 2202150230250243 |
7 | 142424406503352 |
oct | 20023342612363 |
9 | 3810681443320 |
10 | 1102121211123 |
11 | 395452767339 |
12 | 1597221b6983 |
13 | 7cc113b189a |
14 | 3b4b30b5999 |
15 | 1da06d07dd3 |
hex | 1009b8b14f3 |
1102121211123 has 12 divisors (see below), whose sum is σ = 1643306179008. Its totient is φ = 711045942480.
The previous prime is 1102121211071. The next prime is 1102121211161. The reversal of 1102121211123 is 3211121212011.
It is a happy number.
It is not a de Polignac number, because 1102121211123 - 29 = 1102121210611 is a prime.
It is a super-2 number, since 2×11021212111232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102121211096 and 1102121211105.
It is not an unprimeable number, because it can be changed into a prime (1102121211523) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1975127340 + ... + 1975127897.
It is an arithmetic number, because the mean of its divisors is an integer number (136942181584).
Almost surely, 21102121211123 is an apocalyptic number.
1102121211123 is a deficient number, since it is larger than the sum of its proper divisors (541184967885).
1102121211123 is a wasteful number, since it uses less digits than its factorization.
1102121211123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3950255274 (or 3950255271 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1102121211123 its reverse (3211121212011), we get a palindrome (4313242423134).
The spelling of 1102121211123 in words is "one trillion, one hundred two billion, one hundred twenty-one million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •