Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …010010110011110010001 |
3 | 10220100202201021212120111 |
4 | 100002123202112132101 |
5 | 121024121000214301 |
6 | 2202150224041321 |
7 | 142424405535031 |
oct | 20023342263621 |
9 | 3810681255514 |
10 | 1102121101201 |
11 | 3954526a179a |
12 | 159722163241 |
13 | 7cc11373843 |
14 | 3b4b30878c1 |
15 | 1da06cd5551 |
hex | 1009b896791 |
1102121101201 has 2 divisors, whose sum is σ = 1102121101202. Its totient is φ = 1102121101200.
The previous prime is 1102121101199. The next prime is 1102121101217. The reversal of 1102121101201 is 1021011212011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 672152382801 + 429968718400 = 819849^2 + 655720^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102121101201 - 21 = 1102121101199 is a prime.
Together with 1102121101199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1102121101261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551060550600 + 551060550601.
It is an arithmetic number, because the mean of its divisors is an integer number (551060550601).
Almost surely, 21102121101201 is an apocalyptic number.
It is an amenable number.
1102121101201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102121101201 is an equidigital number, since it uses as much as digits as its factorization.
1102121101201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1102121101201 its reverse (1021011212011), we get a palindrome (2123132313212).
The spelling of 1102121101201 in words is "one trillion, one hundred two billion, one hundred twenty-one million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •