Base | Representation |
---|---|
bin | 1100011110001010100100… |
… | …00111011011101010001000 |
3 | 10121002210001112221102122002 |
4 | 12033011102013123222020 |
5 | 12043311333412134333 |
6 | 134154430422450132 |
7 | 5530241501411132 |
oct | 617052207335210 |
9 | 117083045842562 |
10 | 27424743864968 |
11 | 881384aa4a75a |
12 | 30ab123293948 |
13 | 123c1b06a3bc8 |
14 | 6ab5169a8052 |
15 | 3285a94090e8 |
hex | 18f1521dba88 |
27424743864968 has 12 divisors (see below), whose sum is σ = 51421422519495. Its totient is φ = 13712364526440.
The previous prime is 27424743864949. The next prime is 27424743865003. The reversal of 27424743864968 is 86946834742472.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 13712371932484 + 13712371932484 = 3703022^2 + 3703022^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=3703022.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27424743864895 and 27424743864904.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 13886333 + ... + 15737843.
Almost surely, 227424743864968 is an apocalyptic number.
It is an amenable number.
27424743864968 is a deficient number, since it is larger than the sum of its proper divisors (23996678654527).
27424743864968 is an frugal number, since it uses more digits than its factorization.
27424743864968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3703028 (or 1851513 counting only the distinct ones).
The product of its digits is 3121348608, while the sum is 74.
The spelling of 27424743864968 in words is "twenty-seven trillion, four hundred twenty-four billion, seven hundred forty-three million, eight hundred sixty-four thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •