Base | Representation |
---|---|
bin | 11101001000111010101… |
… | …11001101010100000001 |
3 | 10112201022202002000002001 |
4 | 32210131113031110001 |
5 | 112400444310044243 |
6 | 2043542031224001 |
7 | 132223110415213 |
oct | 16443527152401 |
9 | 3481282060061 |
10 | 1001220003073 |
11 | 3566846542a4 |
12 | 142062678001 |
13 | 73550c74954 |
14 | 366604a25b3 |
15 | 1b09d903a4d |
hex | e91d5cd501 |
1001220003073 has 2 divisors, whose sum is σ = 1001220003074. Its totient is φ = 1001220003072.
The previous prime is 1001220003067. The next prime is 1001220003143. The reversal of 1001220003073 is 3703000221001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999584043264 + 1635959809 = 999792^2 + 40447^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001220003073 - 233 = 992630068481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1001220003073.
It is not a weakly prime, because it can be changed into another prime (1001220003473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500610001536 + 500610001537.
It is an arithmetic number, because the mean of its divisors is an integer number (500610001537).
Almost surely, 21001220003073 is an apocalyptic number.
It is an amenable number.
1001220003073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001220003073 is an equidigital number, since it uses as much as digits as its factorization.
1001220003073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 19.
Adding to 1001220003073 its reverse (3703000221001), we get a palindrome (4704220224074).
The spelling of 1001220003073 in words is "one trillion, one billion, two hundred twenty million, three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •