Base | Representation |
---|---|
bin | 100110000001011111110… |
… | …1010111001000111010101 |
3 | 200111120221200011001122121 |
4 | 1030002333222321013111 |
5 | 1141110113324033211 |
6 | 15040424330055541 |
7 | 1046362400302312 |
oct | 114027752710725 |
9 | 20446850131577 |
10 | 5225895924181 |
11 | 1735321012899 |
12 | 704991b7a5b1 |
13 | 2bba524170aa |
14 | 140d12bc9d09 |
15 | 90e0e33c271 |
hex | 4c0bfab91d5 |
5225895924181 has 2 divisors, whose sum is σ = 5225895924182. Its totient is φ = 5225895924180.
The previous prime is 5225895924121. The next prime is 5225895924209. The reversal of 5225895924181 is 1814295985225.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5221270700100 + 4625224081 = 2285010^2 + 68009^2 .
It is a cyclic number.
It is not a de Polignac number, because 5225895924181 - 223 = 5225887535573 is a prime.
It is a super-2 number, since 2×52258959241812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5225895924121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2612947962090 + 2612947962091.
It is an arithmetic number, because the mean of its divisors is an integer number (2612947962091).
Almost surely, 25225895924181 is an apocalyptic number.
It is an amenable number.
5225895924181 is a deficient number, since it is larger than the sum of its proper divisors (1).
5225895924181 is an equidigital number, since it uses as much as digits as its factorization.
5225895924181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736000, while the sum is 61.
The spelling of 5225895924181 in words is "five trillion, two hundred twenty-five billion, eight hundred ninety-five million, nine hundred twenty-four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •