Base | Representation |
---|---|
bin | 11101011011100001111… |
… | …00011111011001001101 |
3 | 10120200010010012012210202 |
4 | 32231300330133121031 |
5 | 113031430312014411 |
6 | 2052313335143245 |
7 | 133025532023015 |
oct | 16556074373115 |
9 | 3520103165722 |
10 | 1011212219981 |
11 | 35a941a327a7 |
12 | 143b90b14b25 |
13 | 74484168632 |
14 | 36d2b59ac45 |
15 | 1b485c7583b |
hex | eb70f1f64d |
1011212219981 has 2 divisors, whose sum is σ = 1011212219982. Its totient is φ = 1011212219980.
The previous prime is 1011212219977. The next prime is 1011212220017. The reversal of 1011212219981 is 1899122121101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 514793335081 + 496418884900 = 717491^2 + 704570^2 .
It is an emirp because it is prime and its reverse (1899122121101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011212219981 - 22 = 1011212219977 is a prime.
It is a super-3 number, since 3×10112122199813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011212219911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505606109990 + 505606109991.
It is an arithmetic number, because the mean of its divisors is an integer number (505606109991).
Almost surely, 21011212219981 is an apocalyptic number.
It is an amenable number.
1011212219981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011212219981 is an equidigital number, since it uses as much as digits as its factorization.
1011212219981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 38.
The spelling of 1011212219981 in words is "one trillion, eleven billion, two hundred twelve million, two hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •