Base | Representation |
---|---|
bin | 110011110010101001… |
… | …0110111100011010101 |
3 | 101122002012010211202022 |
4 | 1213211102313203111 |
5 | 3310240101022442 |
6 | 123032210222525 |
7 | 11015106562553 |
oct | 1474522674325 |
9 | 348065124668 |
10 | 111221110997 |
11 | 43194465957 |
12 | 1967b884a45 |
13 | a6464a33a9 |
14 | 555144abd3 |
15 | 2d5e4033d2 |
hex | 19e54b78d5 |
111221110997 has 2 divisors, whose sum is σ = 111221110998. Its totient is φ = 111221110996.
The previous prime is 111221110921. The next prime is 111221111009. The reversal of 111221110997 is 799011122111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72821181316 + 38399929681 = 269854^2 + 195959^2 .
It is a cyclic number.
It is not a de Polignac number, because 111221110997 - 210 = 111221109973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111221110397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55610555498 + 55610555499.
It is an arithmetic number, because the mean of its divisors is an integer number (55610555499).
Almost surely, 2111221110997 is an apocalyptic number.
It is an amenable number.
111221110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
111221110997 is an equidigital number, since it uses as much as digits as its factorization.
111221110997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 35.
The spelling of 111221110997 in words is "one hundred eleven billion, two hundred twenty-one million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •