Base | Representation |
---|---|
bin | 1010011111100110111110… |
… | …11000110101110011100111 |
3 | 10000201001222212111102021022 |
4 | 11033303133120311303213 |
5 | 11011040241402121002 |
6 | 121025040023441355 |
7 | 4601131345556063 |
oct | 517633730656347 |
9 | 100631885442238 |
10 | 23076312145127 |
11 | 739767767594a |
12 | 27084162b625b |
13 | cb5118bb7ba7 |
14 | 59ac841d0aa3 |
15 | 2a0403e30ba2 |
hex | 14fcdf635ce7 |
23076312145127 has 2 divisors, whose sum is σ = 23076312145128. Its totient is φ = 23076312145126.
The previous prime is 23076312145123. The next prime is 23076312145217. The reversal of 23076312145127 is 72154121367032.
It is a happy number.
Together with next prime (23076312145217) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23076312145127 - 22 = 23076312145123 is a prime.
It is a super-2 number, since 2×230763121451272 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23076312145123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11538156072563 + 11538156072564.
It is an arithmetic number, because the mean of its divisors is an integer number (11538156072564).
Almost surely, 223076312145127 is an apocalyptic number.
23076312145127 is a deficient number, since it is larger than the sum of its proper divisors (1).
23076312145127 is an equidigital number, since it uses as much as digits as its factorization.
23076312145127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 423360, while the sum is 44.
The spelling of 23076312145127 in words is "twenty-three trillion, seventy-six billion, three hundred twelve million, one hundred forty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •