Base | Representation |
---|---|
bin | 101111111110010000… |
… | …1111110000010111101 |
3 | 100211220201012121102221 |
4 | 1133330201332002331 |
5 | 3141441334324013 |
6 | 115154401445341 |
7 | 10304646101065 |
oct | 1377441760275 |
9 | 324821177387 |
10 | 103021011133 |
11 | 3a766747517 |
12 | 17b71640851 |
13 | 993a66c6b1 |
14 | 4db43763a5 |
15 | 2a2e57e08d |
hex | 17fc87e0bd |
103021011133 has 2 divisors, whose sum is σ = 103021011134. Its totient is φ = 103021011132.
The previous prime is 103021011127. The next prime is 103021011157. The reversal of 103021011133 is 331110120301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87475160644 + 15545850489 = 295762^2 + 124683^2 .
It is a cyclic number.
It is not a de Polignac number, because 103021011133 - 29 = 103021010621 is a prime.
It is a super-2 number, since 2×1030210111332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103021011103) 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, 51510505566 + 51510505567.
It is an arithmetic number, because the mean of its divisors is an integer number (51510505567).
Almost surely, 2103021011133 is an apocalyptic number.
It is an amenable number.
103021011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021011133 is an equidigital number, since it uses as much as digits as its factorization.
103021011133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 103021011133 its reverse (331110120301), we get a palindrome (434131131434).
The spelling of 103021011133 in words is "one hundred three billion, twenty-one million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •