Base | Representation |
---|---|
bin | 1010100000100001100011… |
… | …00100110001000010100111 |
3 | 10000211002011020020021022212 |
4 | 11100100301210301002213 |
5 | 11012044140434232434 |
6 | 121051320105514035 |
7 | 4603323505161602 |
oct | 520206144610247 |
9 | 100732136207285 |
10 | 23107755774119 |
11 | 73a9a42797795 |
12 | 27125307a291b |
13 | cb808a396013 |
14 | 59c5c8267339 |
15 | 2a114466b8ce |
hex | 1504319310a7 |
23107755774119 has 2 divisors, whose sum is σ = 23107755774120. Its totient is φ = 23107755774118.
The previous prime is 23107755774017. The next prime is 23107755774121. The reversal of 23107755774119 is 91147755770132.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23107755774119 is a prime.
It is a super-2 number, since 2×231077557741192 (a number of 28 digits) contains 22 as substring.
Together with 23107755774121, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23107755774149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11553877887059 + 11553877887060.
It is an arithmetic number, because the mean of its divisors is an integer number (11553877887060).
Almost surely, 223107755774119 is an apocalyptic number.
23107755774119 is a deficient number, since it is larger than the sum of its proper divisors (1).
23107755774119 is an equidigital number, since it uses as much as digits as its factorization.
23107755774119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12965400, while the sum is 59.
The spelling of 23107755774119 in words is "twenty-three trillion, one hundred seven billion, seven hundred fifty-five million, seven hundred seventy-four thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •