Base | Representation |
---|---|
bin | 10001100111111011111… |
… | …010000001100001110001 |
3 | 11021210002111002101020211 |
4 | 101213323322001201301 |
5 | 124320324144231001 |
6 | 2324213251304121 |
7 | 153333326003614 |
oct | 21477372014161 |
9 | 4253074071224 |
10 | 1211112102001 |
11 | 4276a223186a |
12 | 17687abab041 |
13 | 8a2908023a9 |
14 | 4289225a17b |
15 | 21785520351 |
hex | 119fbe81871 |
1211112102001 has 16 divisors (see below), whose sum is σ = 1313891702928. Its totient is φ = 1111847731200.
The previous prime is 1211112101993. The next prime is 1211112102007. The reversal of 1211112102001 is 1002012111121.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 74297675776 + 1136814426225 = 272576^2 + 1066215^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211112102001 - 23 = 1211112101993 is a prime.
It is a super-2 number, since 2×12111121020012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1211112102007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3393841 + ... + 3733681.
It is an arithmetic number, because the mean of its divisors is an integer number (82118231433).
Almost surely, 21211112102001 is an apocalyptic number.
It is an amenable number.
1211112102001 is a deficient number, since it is larger than the sum of its proper divisors (102779600927).
1211112102001 is a wasteful number, since it uses less digits than its factorization.
1211112102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345012.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1211112102001 its reverse (1002012111121), we get a palindrome (2213124213122).
The spelling of 1211112102001 in words is "one trillion, two hundred eleven billion, one hundred twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •