Base | Representation |
---|---|
bin | 11001101111100111001010… |
… | …000000100000010110100001 |
3 | 112211220000102002002112102001 |
4 | 121233213022000200112201 |
5 | 104320021222114120001 |
6 | 1040445534355124001 |
7 | 32564044014621535 |
oct | 3157471200402641 |
9 | 484800362075361 |
10 | 113223022020001 |
11 | 33092683237483 |
12 | 10847468ba3601 |
13 | 4b23b6791c36a |
14 | 1dd60486d9bc5 |
15 | d152cd5da001 |
hex | 66f9ca0205a1 |
113223022020001 has 2 divisors, whose sum is σ = 113223022020002. Its totient is φ = 113223022020000.
The previous prime is 113223022019953. The next prime is 113223022020041. The reversal of 113223022020001 is 100020220322311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96454005210000 + 16769016810001 = 9821100^2 + 4094999^2 .
It is an emirp because it is prime and its reverse (100020220322311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113223022020001 - 225 = 113222988465569 is a prime.
It is not a weakly prime, because it can be changed into another prime (113223022020041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56611511010000 + 56611511010001.
It is an arithmetic number, because the mean of its divisors is an integer number (56611511010001).
Almost surely, 2113223022020001 is an apocalyptic number.
It is an amenable number.
113223022020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
113223022020001 is an equidigital number, since it uses as much as digits as its factorization.
113223022020001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 113223022020001 its reverse (100020220322311), we get a palindrome (213243242342312).
The spelling of 113223022020001 in words is "one hundred thirteen trillion, two hundred twenty-three billion, twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •