Base | Representation |
---|---|
bin | 11001011000100001… |
… | …101110011100000000 |
3 | 2121100110011110210110 |
4 | 121120201232130000 |
5 | 421304242232434 |
6 | 20304254031320 |
7 | 1653256005162 |
oct | 313041563400 |
9 | 77313143713 |
10 | 27255039744 |
11 | 10616839839 |
12 | 53477a8540 |
13 | 275479916a |
14 | 1467a70932 |
15 | a97b624e9 |
hex | 65886e700 |
27255039744 has 432 divisors, whose sum is σ = 84939482880. Its totient is φ = 7720796160.
The previous prime is 27255039743. The next prime is 27255039781. The reversal of 27255039744 is 44793055272.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 27255039693 and 27255039702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27255039743) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 96992884 + ... + 96993164.
Almost surely, 227255039744 is an apocalyptic number.
27255039744 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27255039744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42469741440).
27255039744 is an abundant number, since it is smaller than the sum of its proper divisors (57684443136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27255039744 is a wasteful number, since it uses less digits than its factorization.
27255039744 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376 (or 345 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 48.
The spelling of 27255039744 in words is "twenty-seven billion, two hundred fifty-five million, thirty-nine thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •