Base | Representation |
---|---|
bin | 1001001101011000101010… |
… | …01100101101100110011001 |
3 | 2122200222200211012012002202 |
4 | 10212230111030231212121 |
5 | 10123243301333022211 |
6 | 111023123345335545 |
7 | 4160044535456033 |
oct | 446542514554631 |
9 | 78628624165082 |
10 | 20251126454681 |
11 | 64a84aaa35371 |
12 | 23309793375b5 |
13 | b3b899856955 |
14 | 5002344d6c53 |
15 | 251ba1a0e53b |
hex | 126b1532d999 |
20251126454681 has 2 divisors, whose sum is σ = 20251126454682. Its totient is φ = 20251126454680.
The previous prime is 20251126454639. The next prime is 20251126454711. The reversal of 20251126454681 is 18645462115202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13233443328400 + 7017683126281 = 3637780^2 + 2649091^2 .
It is a cyclic number.
It is not a de Polignac number, because 20251126454681 - 26 = 20251126454617 is a prime.
It is a super-2 number, since 2×202511264546812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20251122454681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10125563227340 + 10125563227341.
It is an arithmetic number, because the mean of its divisors is an integer number (10125563227341).
Almost surely, 220251126454681 is an apocalyptic number.
It is an amenable number.
20251126454681 is a deficient number, since it is larger than the sum of its proper divisors (1).
20251126454681 is an equidigital number, since it uses as much as digits as its factorization.
20251126454681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 921600, while the sum is 47.
Adding to 20251126454681 its reverse (18645462115202), we get a palindrome (38896588569883).
The spelling of 20251126454681 in words is "twenty trillion, two hundred fifty-one billion, one hundred twenty-six million, four hundred fifty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •