Base | Representation |
---|---|
bin | 101111111110010100… |
… | …1100100010111111101 |
3 | 100211220211221210221201 |
4 | 1133330221210113331 |
5 | 3141442342100013 |
6 | 115154512255501 |
7 | 10305002035501 |
oct | 1377451442775 |
9 | 324824853851 |
10 | 103023003133 |
11 | 3a7678880a6 |
12 | 17b72241591 |
13 | 993abb92ab |
14 | 4db4734301 |
15 | 2a2e8243dd |
hex | 17fca645fd |
103023003133 has 2 divisors, whose sum is σ = 103023003134. Its totient is φ = 103023003132.
The previous prime is 103023003107. The next prime is 103023003143. The reversal of 103023003133 is 331300320301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102171647449 + 851355684 = 319643^2 + 29178^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103023003133 is a prime.
It is a super-2 number, since 2×1030230031332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103023003133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103023003143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51511501566 + 51511501567.
It is an arithmetic number, because the mean of its divisors is an integer number (51511501567).
Almost surely, 2103023003133 is an apocalyptic number.
It is an amenable number.
103023003133 is a deficient number, since it is larger than the sum of its proper divisors (1).
103023003133 is an equidigital number, since it uses as much as digits as its factorization.
103023003133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 103023003133 its reverse (331300320301), we get a palindrome (434323323434).
The spelling of 103023003133 in words is "one hundred three billion, twenty-three million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •