Base | Representation |
---|---|
bin | 11011111110000101000000… |
… | …001000001101110000110001 |
3 | 121010112221122210120100101212 |
4 | 123332011000020031300301 |
5 | 112110422100430020311 |
6 | 1113343255531405505 |
7 | 34624261422356252 |
oct | 3376050010156061 |
9 | 533487583510355 |
10 | 123013234220081 |
11 | 3621768a850357 |
12 | 119689572b3895 |
13 | 5384137a0761a |
14 | 2253c2d860b29 |
15 | e34ccab64c8b |
hex | 6fe14020dc31 |
123013234220081 has 2 divisors, whose sum is σ = 123013234220082. Its totient is φ = 123013234220080.
The previous prime is 123013234220047. The next prime is 123013234220099. The reversal of 123013234220081 is 180022432310321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81997099800625 + 41016134419456 = 9055225^2 + 6404384^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123013234220081 is a prime.
It is a super-2 number, since 2×1230132342200812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (123013234270081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61506617110040 + 61506617110041.
It is an arithmetic number, because the mean of its divisors is an integer number (61506617110041).
Almost surely, 2123013234220081 is an apocalyptic number.
It is an amenable number.
123013234220081 is a deficient number, since it is larger than the sum of its proper divisors (1).
123013234220081 is an equidigital number, since it uses as much as digits as its factorization.
123013234220081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 32.
The spelling of 123013234220081 in words is "one hundred twenty-three trillion, thirteen billion, two hundred thirty-four million, two hundred twenty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •