Base | Representation |
---|---|
bin | 1001011110000011110011… |
… | …1100000100111000111101 |
3 | 1100212101020210101202012101 |
4 | 2113200330330010320331 |
5 | 2331042310403412013 |
6 | 34051114542105101 |
7 | 2123146432101634 |
oct | 227407474047075 |
9 | 40771223352171 |
10 | 10412023107133 |
11 | 335479466a79a |
12 | 1201b0557b191 |
13 | 5a6b0765bb2b |
14 | 27dd3200651b |
15 | 130c921238dd |
hex | 9783cf04e3d |
10412023107133 has 2 divisors, whose sum is σ = 10412023107134. Its totient is φ = 10412023107132.
The previous prime is 10412023107053. The next prime is 10412023107181. The reversal of 10412023107133 is 33170132021401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9841534442884 + 570488664249 = 3137122^2 + 755307^2 .
It is a cyclic number.
It is not a de Polignac number, because 10412023107133 - 221 = 10412021009981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10412023102133) 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, 5206011553566 + 5206011553567.
It is an arithmetic number, because the mean of its divisors is an integer number (5206011553567).
Almost surely, 210412023107133 is an apocalyptic number.
It is an amenable number.
10412023107133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10412023107133 is an equidigital number, since it uses as much as digits as its factorization.
10412023107133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 10412023107133 its reverse (33170132021401), we get a palindrome (43582155128534).
The spelling of 10412023107133 in words is "ten trillion, four hundred twelve billion, twenty-three million, one hundred seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •