Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …010100011001000111101 |
3 | 10220100111010012002122201 |
4 | 100002111002203020331 |
5 | 121023410044214211 |
6 | 2202131331511501 |
7 | 142421613206515 |
oct | 20022502431075 |
9 | 3810433162581 |
10 | 1102012101181 |
11 | 3953a7113432 |
12 | 1596b1758591 |
13 | 7cbc48cb6a4 |
14 | 3b4a27d2845 |
15 | 1d9ec4540c1 |
hex | 100950a323d |
1102012101181 has 2 divisors, whose sum is σ = 1102012101182. Its totient is φ = 1102012101180.
The previous prime is 1102012101101. The next prime is 1102012101247. The reversal of 1102012101181 is 1811012102011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 854082795556 + 247929305625 = 924166^2 + 497925^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102012101181 - 225 = 1101978546749 is a prime.
It is a super-2 number, since 2×11020121011812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102012101101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006050590 + 551006050591.
It is an arithmetic number, because the mean of its divisors is an integer number (551006050591).
Almost surely, 21102012101181 is an apocalyptic number.
It is an amenable number.
1102012101181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102012101181 is an equidigital number, since it uses as much as digits as its factorization.
1102012101181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 1102012101181 its reverse (1811012102011), we get a palindrome (2913024203192).
The spelling of 1102012101181 in words is "one trillion, one hundred two billion, twelve million, one hundred one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •