Base | Representation |
---|---|
bin | 1001000110110000000001… |
… | …10000000001011000010101 |
3 | 2121220012020202111120121211 |
4 | 10203120000300001120111 |
5 | 10111024402412410032 |
6 | 110330301433341421 |
7 | 4134424216561303 |
oct | 443300060013025 |
9 | 77805222446554 |
10 | 20023150122517 |
11 | 641a8522727a3 |
12 | 22b4754567871 |
13 | b232374b5799 |
14 | 4d31a8a67273 |
15 | 24acac44b747 |
hex | 123600c01615 |
20023150122517 has 2 divisors, whose sum is σ = 20023150122518. Its totient is φ = 20023150122516.
The previous prime is 20023150122509. The next prime is 20023150122617. The reversal of 20023150122517 is 71522105132002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20014877492401 + 8272630116 = 4473799^2 + 90954^2 .
It is a cyclic number.
It is not a de Polignac number, because 20023150122517 - 23 = 20023150122509 is a prime.
It is a super-2 number, since 2×200231501225172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20023150122317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011575061258 + 10011575061259.
It is an arithmetic number, because the mean of its divisors is an integer number (10011575061259).
Almost surely, 220023150122517 is an apocalyptic number.
It is an amenable number.
20023150122517 is a deficient number, since it is larger than the sum of its proper divisors (1).
20023150122517 is an equidigital number, since it uses as much as digits as its factorization.
20023150122517 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8400, while the sum is 31.
Adding to 20023150122517 its reverse (71522105132002), we get a palindrome (91545255254519).
The spelling of 20023150122517 in words is "twenty trillion, twenty-three billion, one hundred fifty million, one hundred twenty-two thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •