Base | Representation |
---|---|
bin | 1001001110110100001011… |
… | …1101010111011100011001 |
3 | 1022221100021002101111220121 |
4 | 2103231002331113130121 |
5 | 2312244432030303023 |
6 | 33330523355353241 |
7 | 2065215465563452 |
oct | 223550275273431 |
9 | 38840232344817 |
10 | 10150131103513 |
11 | 3263712438185 |
12 | 117b1b6452821 |
13 | 5881cb91b80b |
14 | 2713aa08a129 |
15 | 1290652bcd5d |
hex | 93b42f57719 |
10150131103513 has 2 divisors, whose sum is σ = 10150131103514. Its totient is φ = 10150131103512.
The previous prime is 10150131103499. The next prime is 10150131103523. The reversal of 10150131103513 is 31530113105101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10140129503449 + 10001600064 = 3184357^2 + 100008^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10150131103513 is a prime.
It is a super-2 number, since 2×101501311035132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10150131103523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075065551756 + 5075065551757.
It is an arithmetic number, because the mean of its divisors is an integer number (5075065551757).
Almost surely, 210150131103513 is an apocalyptic number.
It is an amenable number.
10150131103513 is a deficient number, since it is larger than the sum of its proper divisors (1).
10150131103513 is an equidigital number, since it uses as much as digits as its factorization.
10150131103513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 675, while the sum is 25.
Adding to 10150131103513 its reverse (31530113105101), we get a palindrome (41680244208614).
The spelling of 10150131103513 in words is "ten trillion, one hundred fifty billion, one hundred thirty-one million, one hundred three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •