Base | Representation |
---|---|
bin | 11011111110000011001000… |
… | …000100101010011101101011 |
3 | 121010112202110102111112122102 |
4 | 123332003020010222131223 |
5 | 112110403434311220042 |
6 | 1113342324020244015 |
7 | 34624160464105061 |
oct | 3376031004523553 |
9 | 533482412445572 |
10 | 123011220023147 |
11 | 36216846897395 |
12 | 1196849484060b |
13 | 5383ba662c311 |
14 | 2253abc14c031 |
15 | e34c0ddeab32 |
hex | 6fe0c812a76b |
123011220023147 has 2 divisors, whose sum is σ = 123011220023148. Its totient is φ = 123011220023146.
The previous prime is 123011220023137. The next prime is 123011220023149. The reversal of 123011220023147 is 741320022110321.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123011220023147 - 28 = 123011220022891 is a prime.
It is a super-4 number, since 4×1230112200231474 (a number of 57 digits) contains 4444 as substring.
Together with 123011220023149, 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 (123011220023149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61505610011573 + 61505610011574.
It is an arithmetic number, because the mean of its divisors is an integer number (61505610011574).
Almost surely, 2123011220023147 is an apocalyptic number.
123011220023147 is a deficient number, since it is larger than the sum of its proper divisors (1).
123011220023147 is an equidigital number, since it uses as much as digits as its factorization.
123011220023147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 29.
Adding to 123011220023147 its reverse (741320022110321), we get a palindrome (864331242133468).
The spelling of 123011220023147 in words is "one hundred twenty-three trillion, eleven billion, two hundred twenty million, twenty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •