Base | Representation |
---|---|
bin | 1100011000100000101001… |
… | …10001100010000010100111 |
3 | 10120102012112021011121120021 |
4 | 12030100110301202002213 |
5 | 12032120420420413242 |
6 | 133525254134020011 |
7 | 5510222501032663 |
oct | 614202461420247 |
9 | 116365467147507 |
10 | 27230441185447 |
11 | 8749402175785 |
12 | 30795377a7607 |
13 | 1226a868251a6 |
14 | 6a1d634258a3 |
15 | 3234d622eb67 |
hex | 18c414c620a7 |
27230441185447 has 2 divisors, whose sum is σ = 27230441185448. Its totient is φ = 27230441185446.
The previous prime is 27230441185411. The next prime is 27230441185481. The reversal of 27230441185447 is 74458114403272.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 27230441185447 - 231 = 27228293701799 is a prime.
It is a super-3 number, since 3×272304411854473 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27230441185394 and 27230441185403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27230441185147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13615220592723 + 13615220592724.
It is an arithmetic number, because the mean of its divisors is an integer number (13615220592724).
Almost surely, 227230441185447 is an apocalyptic number.
27230441185447 is a deficient number, since it is larger than the sum of its proper divisors (1).
27230441185447 is an equidigital number, since it uses as much as digits as its factorization.
27230441185447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6021120, while the sum is 52.
The spelling of 27230441185447 in words is "twenty-seven trillion, two hundred thirty billion, four hundred forty-one million, one hundred eighty-five thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •