Base | Representation |
---|---|
bin | 11011111111010110110110… |
… | …100101101011001110001011 |
3 | 121010212100111210001101000001 |
4 | 123333112312211223032023 |
5 | 112113342043434002311 |
6 | 1113451512502223431 |
7 | 34633522351566265 |
oct | 3377266645531613 |
9 | 533770453041001 |
10 | 123101121000331 |
11 | 3625098a624141 |
12 | 119819a4424b77 |
13 | 538c502a907c6 |
14 | 22581a9c30b35 |
15 | e372217174c1 |
hex | 6ff5b696b38b |
123101121000331 has 2 divisors, whose sum is σ = 123101121000332. Its totient is φ = 123101121000330.
The previous prime is 123101121000293. The next prime is 123101121000337. The reversal of 123101121000331 is 133000121101321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123101121000331 - 27 = 123101121000203 is a prime.
It is a super-2 number, since 2×1231011210003312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123101121000299 and 123101121000308.
It is not a weakly prime, because it can be changed into another prime (123101121000337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61550560500165 + 61550560500166.
It is an arithmetic number, because the mean of its divisors is an integer number (61550560500166).
Almost surely, 2123101121000331 is an apocalyptic number.
123101121000331 is a deficient number, since it is larger than the sum of its proper divisors (1).
123101121000331 is an equidigital number, since it uses as much as digits as its factorization.
123101121000331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 123101121000331 its reverse (133000121101321), we get a palindrome (256101242101652).
The spelling of 123101121000331 in words is "one hundred twenty-three trillion, one hundred one billion, one hundred twenty-one million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •