Base | Representation |
---|---|
bin | 11101111110110000010… |
… | …00010001111011111001 |
3 | 10122110221001121012202222 |
4 | 32333120020101323321 |
5 | 113334143021424032 |
6 | 2105122043533425 |
7 | 134265262002554 |
oct | 16773010217371 |
9 | 3573831535688 |
10 | 1030123233017 |
11 | 36796678979a |
12 | 14778a22a275 |
13 | 761a904a288 |
14 | 37c02dad69b |
15 | 1bbe10d3a12 |
hex | efd8211ef9 |
1030123233017 has 2 divisors, whose sum is σ = 1030123233018. Its totient is φ = 1030123233016.
The previous prime is 1030123232989. The next prime is 1030123233037. The reversal of 1030123233017 is 7103323210301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 759609861136 + 270513371881 = 871556^2 + 520109^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030123233017 - 222 = 1030119038713 is a prime.
It is a super-2 number, since 2×10301232330172 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030123233037) 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, 515061616508 + 515061616509.
It is an arithmetic number, because the mean of its divisors is an integer number (515061616509).
Almost surely, 21030123233017 is an apocalyptic number.
It is an amenable number.
1030123233017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030123233017 is an equidigital number, since it uses as much as digits as its factorization.
1030123233017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 26.
Adding to 1030123233017 its reverse (7103323210301), we get a palindrome (8133446443318).
The spelling of 1030123233017 in words is "one trillion, thirty billion, one hundred twenty-three million, two hundred thirty-three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •