Base | Representation |
---|---|
bin | 10011100001111011101… |
… | …101011000100010111001 |
3 | 11202022012121212211222001 |
4 | 103201323231120202321 |
5 | 133442112423302222 |
6 | 2504315450101001 |
7 | 165651422513545 |
oct | 23417355304271 |
9 | 4668177784861 |
10 | 1342105290937 |
11 | 4782024a24a4 |
12 | 19813841a761 |
13 | 9973839ab88 |
14 | 48d5b5bca25 |
15 | 24da066be27 |
hex | 1387bb588b9 |
1342105290937 has 2 divisors, whose sum is σ = 1342105290938. Its totient is φ = 1342105290936.
The previous prime is 1342105290923. The next prime is 1342105290983. The reversal of 1342105290937 is 7390925012431.
It is a happy number.
It is an a-pointer prime, because the next prime (1342105290983) can be obtained adding 1342105290937 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1293414896656 + 48690394281 = 1137284^2 + 220659^2 .
It is a cyclic number.
It is not a de Polignac number, because 1342105290937 - 27 = 1342105290809 is a prime.
It is a super-2 number, since 2×13421052909372 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1342105290917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671052645468 + 671052645469.
It is an arithmetic number, because the mean of its divisors is an integer number (671052645469).
Almost surely, 21342105290937 is an apocalyptic number.
It is an amenable number.
1342105290937 is a deficient number, since it is larger than the sum of its proper divisors (1).
1342105290937 is an equidigital number, since it uses as much as digits as its factorization.
1342105290937 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 1342105290937 in words is "one trillion, three hundred forty-two billion, one hundred five million, two hundred ninety thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •