Base | Representation |
---|---|
bin | 1001011001111111101101… |
… | …1001011100110000101101 |
3 | 1100121201000222111100110022 |
4 | 2112133323121130300231 |
5 | 2323421313213042333 |
6 | 33555050513051525 |
7 | 2115125312551061 |
oct | 226377331346055 |
9 | 40551028440408 |
10 | 10342204034093 |
11 | 3328116613838 |
12 | 11b047b256ba5 |
13 | 5a035b851269 |
14 | 27a7cb449aa1 |
15 | 12e057850c98 |
hex | 967fb65cc2d |
10342204034093 has 2 divisors, whose sum is σ = 10342204034094. Its totient is φ = 10342204034092.
The previous prime is 10342204034069. The next prime is 10342204034119. The reversal of 10342204034093 is 39043040224301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10039278184324 + 302925849769 = 3168482^2 + 550387^2 .
It is a cyclic number.
It is not a de Polignac number, because 10342204034093 - 214 = 10342204017709 is a prime.
It is a super-2 number, since 2×103422040340932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10342204024093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5171102017046 + 5171102017047.
It is an arithmetic number, because the mean of its divisors is an integer number (5171102017047).
Almost surely, 210342204034093 is an apocalyptic number.
It is an amenable number.
10342204034093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10342204034093 is an equidigital number, since it uses as much as digits as its factorization.
10342204034093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 10342204034093 its reverse (39043040224301), we get a palindrome (49385244258394).
The spelling of 10342204034093 in words is "ten trillion, three hundred forty-two billion, two hundred four million, thirty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •