Base | Representation |
---|---|
bin | 11110100101101011110… |
… | …11001110011110000001 |
3 | 10201110212200111110200001 |
4 | 33102311323032132001 |
5 | 114204444200101311 |
6 | 2122500040400001 |
7 | 135635234325001 |
oct | 17226573163601 |
9 | 3643780443601 |
10 | 1051024222081 |
11 | 375811856179 |
12 | 14b841a76001 |
13 | 7815a2a6822 |
14 | 38c26bcc001 |
15 | 1c515ec44c1 |
hex | f4b5ece781 |
1051024222081 has 2 divisors, whose sum is σ = 1051024222082. Its totient is φ = 1051024222080.
The previous prime is 1051024222069. The next prime is 1051024222091. The reversal of 1051024222081 is 1802224201501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 819070250625 + 231953971456 = 905025^2 + 481616^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051024222081 - 235 = 1016664483713 is a prime.
It is a super-2 number, since 2×10510242220812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1051024222021) 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, 525512111040 + 525512111041.
It is an arithmetic number, because the mean of its divisors is an integer number (525512111041).
Almost surely, 21051024222081 is an apocalyptic number.
It is an amenable number.
1051024222081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051024222081 is an equidigital number, since it uses as much as digits as its factorization.
1051024222081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 1051024222081 its reverse (1802224201501), we get a palindrome (2853248423582).
The spelling of 1051024222081 in words is "one trillion, fifty-one billion, twenty-four million, two hundred twenty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •