Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …11110111100100001101 |
3 | 10120122121210210012121201 |
4 | 32231211203313210031 |
5 | 113031032412403023 |
6 | 2052242353225501 |
7 | 133021022354104 |
oct | 16554543674415 |
9 | 3518553705551 |
10 | 1011021216013 |
11 | 35a854134686 |
12 | 143b38b62291 |
13 | 74453710c33 |
14 | 36d1007b03b |
15 | 1b4740e6bad |
hex | eb658f790d |
1011021216013 has 2 divisors, whose sum is σ = 1011021216014. Its totient is φ = 1011021216012.
The previous prime is 1011021216011. The next prime is 1011021216059. The reversal of 1011021216013 is 3106121201101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 813456078724 + 197565137289 = 901918^2 + 444483^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011021216013 - 21 = 1011021216011 is a prime.
Together with 1011021216011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011021216011) 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, 505510608006 + 505510608007.
It is an arithmetic number, because the mean of its divisors is an integer number (505510608007).
Almost surely, 21011021216013 is an apocalyptic number.
It is an amenable number.
1011021216013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011021216013 is an equidigital number, since it uses as much as digits as its factorization.
1011021216013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1011021216013 its reverse (3106121201101), we get a palindrome (4117142417114).
The spelling of 1011021216013 in words is "one trillion, eleven billion, twenty-one million, two hundred sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •