Base | Representation |
---|---|
bin | 11001100100100010… |
… | …001100101000010000 |
3 | 2121212111020012121001 |
4 | 121210202030220100 |
5 | 422212330140000 |
6 | 20340251511344 |
7 | 1661253212542 |
oct | 314442145020 |
9 | 77774205531 |
10 | 27456490000 |
11 | 1070a522355 |
12 | 53a3158554 |
13 | 27874405b4 |
14 | 148670d692 |
15 | aaa6a646a |
hex | 66488ca10 |
27456490000 has 75 divisors (see below), whose sum is σ = 66515049777. Its totient is φ = 10975968000.
The previous prime is 27456489997. The next prime is 27456490007. The reversal of 27456490000 is 9465472.
The square root of 27456490000 is 165700.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 24808770064 + 2647719936 = 157508^2 + 51456^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27456490007) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 16569172 + ... + 16570828.
Almost surely, 227456490000 is an apocalyptic number.
27456490000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
27456490000 is the 165700-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27456490000
27456490000 is an abundant number, since it is smaller than the sum of its proper divisors (39058559777).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27456490000 is an frugal number, since it uses more digits than its factorization.
27456490000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3342 (or 1664 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 27456490000 in words is "twenty-seven billion, four hundred fifty-six million, four hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •