Base | Representation |
---|---|
bin | 11101011101001111111… |
… | …01010110010010100001 |
3 | 10120202111102221000222222 |
4 | 32232213331112102201 |
5 | 113040323102113323 |
6 | 2052545105440425 |
7 | 133060440115502 |
oct | 16564775262241 |
9 | 3522442830888 |
10 | 1012135191713 |
11 | 360275a25058 |
12 | 1441aa040115 |
13 | 745a0445c59 |
14 | 36db7db6ba9 |
15 | 1b4dbcdd9c8 |
hex | eba7f564a1 |
1012135191713 has 2 divisors, whose sum is σ = 1012135191714. Its totient is φ = 1012135191712.
The previous prime is 1012135191701. The next prime is 1012135191779. The reversal of 1012135191713 is 3171915312101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012060144144 + 75047569 = 1006012^2 + 8663^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012135191713 - 26 = 1012135191649 is a prime.
It is a super-2 number, since 2×10121351917132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1012135196713) 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, 506067595856 + 506067595857.
It is an arithmetic number, because the mean of its divisors is an integer number (506067595857).
Almost surely, 21012135191713 is an apocalyptic number.
It is an amenable number.
1012135191713 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012135191713 is an equidigital number, since it uses as much as digits as its factorization.
1012135191713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 35.
The spelling of 1012135191713 in words is "one trillion, twelve billion, one hundred thirty-five million, one hundred ninety-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •