Base | Representation |
---|---|
bin | 1001001101110001000011… |
… | …1111110110000001011101 |
3 | 1022212121202101012012011212 |
4 | 2103130100333312001131 |
5 | 2312001031413214234 |
6 | 33314343425354205 |
7 | 2064010130455622 |
oct | 223342077660135 |
9 | 38777671165155 |
10 | 10132113023069 |
11 | 3257006726704 |
12 | 1177808198965 |
13 | 5865b9a2a75b |
14 | 27057b0b4349 |
15 | 12885d5425ce |
hex | 93710ff605d |
10132113023069 has 2 divisors, whose sum is σ = 10132113023070. Its totient is φ = 10132113023068.
The previous prime is 10132113022909. The next prime is 10132113023119. The reversal of 10132113023069 is 96032031123101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9576734836900 + 555378186169 = 3094630^2 + 745237^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132113023069 - 236 = 10063393546333 is a prime.
It is a super-2 number, since 2×101321130230692 (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 (10132113023369) 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, 5066056511534 + 5066056511535.
It is an arithmetic number, because the mean of its divisors is an integer number (5066056511535).
Almost surely, 210132113023069 is an apocalyptic number.
It is an amenable number.
10132113023069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132113023069 is an equidigital number, since it uses as much as digits as its factorization.
10132113023069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 10132113023069 in words is "ten trillion, one hundred thirty-two billion, one hundred thirteen million, twenty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •