Base | Representation |
---|---|
bin | 10110110000101100001011… |
… | …111100001101100010001111 |
3 | 111010102202100101211020002111 |
4 | 112300230023330031202033 |
5 | 101110041422243220302 |
6 | 552522403524404451 |
7 | 30041126510101222 |
oct | 2660541374154217 |
9 | 433382311736074 |
10 | 100103003101327 |
11 | 299944996307a6 |
12 | b288771246727 |
13 | 43b1898b84705 |
14 | 1aa1022a455b9 |
15 | b88d974b20d7 |
hex | 5b0b0bf0d88f |
100103003101327 has 2 divisors, whose sum is σ = 100103003101328. Its totient is φ = 100103003101326.
The previous prime is 100103003101291. The next prime is 100103003101337. The reversal of 100103003101327 is 723101300301001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100103003101327 - 211 = 100103003099279 is a prime.
It is a super-2 number, since 2×1001030031013272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100103003101298 and 100103003101307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100103003101337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051501550663 + 50051501550664.
It is an arithmetic number, because the mean of its divisors is an integer number (50051501550664).
Almost surely, 2100103003101327 is an apocalyptic number.
100103003101327 is a deficient number, since it is larger than the sum of its proper divisors (1).
100103003101327 is an equidigital number, since it uses as much as digits as its factorization.
100103003101327 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 378, while the sum is 22.
Adding to 100103003101327 its reverse (723101300301001), we get a palindrome (823204303402328).
The spelling of 100103003101327 in words is "one hundred trillion, one hundred three billion, three million, one hundred one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •