Base | Representation |
---|---|
bin | 11101011101001100011… |
… | …01000110110111111001 |
3 | 10120202102101120011212011 |
4 | 32232212031012313321 |
5 | 113040243034042231 |
6 | 2052542135045521 |
7 | 133056632041405 |
oct | 16564615066771 |
9 | 3522371504764 |
10 | 1012105768441 |
11 | 3602603589a9 |
12 | 1441a02108a1 |
13 | 74597313631 |
14 | 36db4118105 |
15 | 1b4d942a9b1 |
hex | eba6346df9 |
1012105768441 has 2 divisors, whose sum is σ = 1012105768442. Its totient is φ = 1012105768440.
The previous prime is 1012105768381. The next prime is 1012105768469. The reversal of 1012105768441 is 1448675012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 545064741225 + 467041027216 = 738285^2 + 683404^2 .
It is an emirp because it is prime and its reverse (1448675012101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1012105768441 - 27 = 1012105768313 is a prime.
It is a super-2 number, since 2×10121057684412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012105768394 and 1012105768403.
It is not a weakly prime, because it can be changed into another prime (1012105763441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506052884220 + 506052884221.
It is an arithmetic number, because the mean of its divisors is an integer number (506052884221).
Almost surely, 21012105768441 is an apocalyptic number.
It is an amenable number.
1012105768441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012105768441 is an equidigital number, since it uses as much as digits as its factorization.
1012105768441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 53760, while the sum is 40.
The spelling of 1012105768441 in words is "one trillion, twelve billion, one hundred five million, seven hundred sixty-eight thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •