Base | Representation |
---|---|
bin | 11101011011100100000… |
… | …00101100111001010001 |
3 | 10120200011100211200001102 |
4 | 32231302000230321101 |
5 | 113031444401213243 |
6 | 2052315214314145 |
7 | 133026140015333 |
oct | 16556200547121 |
9 | 3520140750042 |
10 | 1011230101073 |
11 | 35a951036065 |
12 | 143b96ab8955 |
13 | 74487a8946a |
14 | 36d2dad3453 |
15 | 1b4876089b8 |
hex | eb7202ce51 |
1011230101073 has 2 divisors, whose sum is σ = 1011230101074. Its totient is φ = 1011230101072.
The previous prime is 1011230101069. The next prime is 1011230101111. The reversal of 1011230101073 is 3701010321101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 973513742224 + 37716358849 = 986668^2 + 194207^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011230101073 - 22 = 1011230101069 is a prime.
It is a super-2 number, since 2×10112301010732 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011230101033) 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, 505615050536 + 505615050537.
It is an arithmetic number, because the mean of its divisors is an integer number (505615050537).
Almost surely, 21011230101073 is an apocalyptic number.
It is an amenable number.
1011230101073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011230101073 is an equidigital number, since it uses as much as digits as its factorization.
1011230101073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 20.
Adding to 1011230101073 its reverse (3701010321101), we get a palindrome (4712240422174).
The spelling of 1011230101073 in words is "one trillion, eleven billion, two hundred thirty million, one hundred one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •