Base | Representation |
---|---|
bin | 11101111110110001001… |
… | …01111100100111110001 |
3 | 10122110221121020022211121 |
4 | 32333120211330213301 |
5 | 113334202014310113 |
6 | 2105122522342241 |
7 | 134265415053226 |
oct | 16773045744761 |
9 | 3573847208747 |
10 | 1030131010033 |
11 | 367970110784 |
12 | 14779095a981 |
13 | 761aa841068 |
14 | 37c0403594d |
15 | 1bbe1b1ce8d |
hex | efd897c9f1 |
1030131010033 has 2 divisors, whose sum is σ = 1030131010034. Its totient is φ = 1030131010032.
The previous prime is 1030131009997. The next prime is 1030131010093. The reversal of 1030131010033 is 3300101310301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 670446540864 + 359684469169 = 818808^2 + 599737^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030131010033 is a prime.
It is a super-2 number, since 2×10301310100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030131009989 and 1030131010016.
It is not a weakly prime, because it can be changed into another prime (1030131010093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515065505016 + 515065505017.
It is an arithmetic number, because the mean of its divisors is an integer number (515065505017).
Almost surely, 21030131010033 is an apocalyptic number.
It is an amenable number.
1030131010033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030131010033 is an equidigital number, since it uses as much as digits as its factorization.
1030131010033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 1030131010033 its reverse (3300101310301), we get a palindrome (4330232320334).
The spelling of 1030131010033 in words is "one trillion, thirty billion, one hundred thirty-one million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •