Base | Representation |
---|---|
bin | 1010000110101100000011… |
… | …1111100101101001011001 |
3 | 1110100002220121221112201201 |
4 | 2201223000333211221121 |
5 | 2424011311432302301 |
6 | 35343512501114201 |
7 | 2224446510040456 |
oct | 241530077455131 |
9 | 43302817845651 |
10 | 11110023322201 |
11 | 35a3809589371 |
12 | 12b52443b8961 |
13 | 6278946c857b |
14 | 2a5a298aa82d |
15 | 143ee585c201 |
hex | a1ac0fe5a59 |
11110023322201 has 2 divisors, whose sum is σ = 11110023322202. Its totient is φ = 11110023322200.
The previous prime is 11110023322117. The next prime is 11110023322207. The reversal of 11110023322201 is 10222332001111.
11110023322201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11109655603225 + 367718976 = 3333115^2 + 19176^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110023322201 is a prime.
It is not a weakly prime, because it can be changed into another prime (11110023322207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555011661100 + 5555011661101.
It is an arithmetic number, because the mean of its divisors is an integer number (5555011661101).
Almost surely, 211110023322201 is an apocalyptic number.
It is an amenable number.
11110023322201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110023322201 is an equidigital number, since it uses as much as digits as its factorization.
11110023322201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11110023322201 its reverse (10222332001111), we get a palindrome (21332355323312).
The spelling of 11110023322201 in words is "eleven trillion, one hundred ten billion, twenty-three million, three hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •