Base | Representation |
---|---|
bin | 11011111111011000111000… |
… | …101101001010111000001001 |
3 | 121010212120010220202101210202 |
4 | 123333120320231022320021 |
5 | 112113411031311044311 |
6 | 1113452513243421545 |
7 | 34633630430033633 |
oct | 3377307055127011 |
9 | 533776126671722 |
10 | 123103304003081 |
11 | 362518aa8a4446 |
12 | 119822b35248b5 |
13 | 538c7901206cc |
14 | 2258335b25a53 |
15 | e372ed1c7e3b |
hex | 6ff638b4ae09 |
123103304003081 has 2 divisors, whose sum is σ = 123103304003082. Its totient is φ = 123103304003080.
The previous prime is 123103304003051. The next prime is 123103304003083. The reversal of 123103304003081 is 180300403301321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103882795828681 + 19220508174400 = 10192291^2 + 4384120^2 .
It is a cyclic number.
It is not a de Polignac number, because 123103304003081 - 222 = 123103299808777 is a prime.
It is a super-2 number, since 2×1231033040030812 (a number of 29 digits) contains 22 as substring.
Together with 123103304003083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (123103304003083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61551652001540 + 61551652001541.
It is an arithmetic number, because the mean of its divisors is an integer number (61551652001541).
Almost surely, 2123103304003081 is an apocalyptic number.
It is an amenable number.
123103304003081 is a deficient number, since it is larger than the sum of its proper divisors (1).
123103304003081 is an equidigital number, since it uses as much as digits as its factorization.
123103304003081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 123103304003081 in words is "one hundred twenty-three trillion, one hundred three billion, three hundred four million, three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •