Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …010111001100101001110011 |
3 | 111101012100102020011021211112 |
4 | 113030133001113030221303 |
5 | 101332340122124043443 |
6 | 1000544044135103535 |
7 | 30326124354503615 |
oct | 2714370127145163 |
9 | 441170366137745 |
10 | 102013012331123 |
11 | 2a560525a94a23 |
12 | b53697b511bab |
13 | 44bca2a4a891a |
14 | 1b2965591adb5 |
15 | bbd8d4d37b18 |
hex | 5cc7c15cca73 |
102013012331123 has 2 divisors, whose sum is σ = 102013012331124. Its totient is φ = 102013012331122.
The previous prime is 102013012331011. The next prime is 102013012331203. The reversal of 102013012331123 is 321133210310201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102013012331123 - 236 = 101944292854387 is a prime.
It is a super-2 number, since 2×1020130123311232 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (102013012331323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006506165561 + 51006506165562.
It is an arithmetic number, because the mean of its divisors is an integer number (51006506165562).
Almost surely, 2102013012331123 is an apocalyptic number.
102013012331123 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013012331123 is an equidigital number, since it uses as much as digits as its factorization.
102013012331123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 102013012331123 its reverse (321133210310201), we get a palindrome (423146222641324).
The spelling of 102013012331123 in words is "one hundred two trillion, thirteen billion, twelve million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •