Base | Representation |
---|---|
bin | 10101110110000111110… |
… | …100010011000011110111 |
3 | 12022111220202110100101211 |
4 | 111312013310103003313 |
5 | 144044000342020043 |
6 | 3105352454102251 |
7 | 213313454220151 |
oct | 25660764230367 |
9 | 5274822410354 |
10 | 1501222220023 |
11 | 529734896389 |
12 | 202b4434a987 |
13 | ab7456ba816 |
14 | 52933b01ad1 |
15 | 290b4823a9d |
hex | 15d87d130f7 |
1501222220023 has 2 divisors, whose sum is σ = 1501222220024. Its totient is φ = 1501222220022.
The previous prime is 1501222219897. The next prime is 1501222220063. The reversal of 1501222220023 is 3200222221051.
It is a strong prime.
It is an emirp because it is prime and its reverse (3200222221051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1501222220023 - 213 = 1501222211831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1501222219976 and 1501222220003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1501222220063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 750611110011 + 750611110012.
It is an arithmetic number, because the mean of its divisors is an integer number (750611110012).
Almost surely, 21501222220023 is an apocalyptic number.
1501222220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1501222220023 is an equidigital number, since it uses as much as digits as its factorization.
1501222220023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 1501222220023 its reverse (3200222221051), we get a palindrome (4701444441074).
The spelling of 1501222220023 in words is "one trillion, five hundred one billion, two hundred twenty-two million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •