Base | Representation |
---|---|
bin | 10011000100001111111… |
… | …111001010110111010101 |
3 | 11122020221102000001201121 |
4 | 103010033333022313111 |
5 | 132431324202234333 |
6 | 2441525101323541 |
7 | 163442541544345 |
oct | 23041777126725 |
9 | 4566842001647 |
10 | 1310233243093 |
11 | 465737565195 |
12 | 191b225665b1 |
13 | 9672920b078 |
14 | 475b66a4d25 |
15 | 2413750732d |
hex | 1310ffcadd5 |
1310233243093 has 2 divisors, whose sum is σ = 1310233243094. Its totient is φ = 1310233243092.
The previous prime is 1310233243057. The next prime is 1310233243127. The reversal of 1310233243093 is 3903423320131.
It is an a-pointer prime, because the next prime (1310233243127) can be obtained adding 1310233243093 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1306215838404 + 4017404689 = 1142898^2 + 63383^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310233243093 - 29 = 1310233242581 is a prime.
It is a super-2 number, since 2×13102332430932 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310233243013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655116621546 + 655116621547.
It is an arithmetic number, because the mean of its divisors is an integer number (655116621547).
Almost surely, 21310233243093 is an apocalyptic number.
It is an amenable number.
1310233243093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310233243093 is an equidigital number, since it uses as much as digits as its factorization.
1310233243093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 34.
The spelling of 1310233243093 in words is "one trillion, three hundred ten billion, two hundred thirty-three million, two hundred forty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •