Base | Representation |
---|---|
bin | 1001001000000100011011… |
… | …0011001011000001111101 |
3 | 1022112021002211200201110121 |
4 | 2102001012303023001331 |
5 | 2303400101221014401 |
6 | 33201355015134541 |
7 | 2053643415550534 |
oct | 222010663130175 |
9 | 38467084621417 |
10 | 10034231423101 |
11 | 3219548056936 |
12 | 116084b974451 |
13 | 57a2bb07bc72 |
14 | 26993352d31b |
15 | 1260302a6ca1 |
hex | 92046ccb07d |
10034231423101 has 2 divisors, whose sum is σ = 10034231423102. Its totient is φ = 10034231423100.
The previous prime is 10034231423081. The next prime is 10034231423107. The reversal of 10034231423101 is 10132413243001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9345952123225 + 688279299876 = 3057115^2 + 829626^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10034231423101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10034231423107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5017115711550 + 5017115711551.
It is an arithmetic number, because the mean of its divisors is an integer number (5017115711551).
Almost surely, 210034231423101 is an apocalyptic number.
It is an amenable number.
10034231423101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10034231423101 is an equidigital number, since it uses as much as digits as its factorization.
10034231423101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10034231423101 its reverse (10132413243001), we get a palindrome (20166644666102).
The spelling of 10034231423101 in words is "ten trillion, thirty-four billion, two hundred thirty-one million, four hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •