Base | Representation |
---|---|
bin | 110011100011… |
… | …1010100100110 |
3 | 1212212022022120 |
4 | 1213013110212 |
5 | 23404441242 |
6 | 2403210410 |
7 | 445521030 |
oct | 147072446 |
9 | 55768276 |
10 | 27030822 |
11 | 14292725 |
12 | 9076a06 |
13 | 57a5690 |
14 | 3838c50 |
15 | 258e1ec |
hex | 19c7526 |
27030822 has 64 divisors (see below), whose sum is σ = 68726784. Its totient is φ = 6894720.
The previous prime is 27030811. The next prime is 27030827. The reversal of 27030822 is 22803072.
It is a junction number, because it is equal to n+sod(n) for n = 27030792 and 27030801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27030827) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16128 + ... + 17724.
It is an arithmetic number, because the mean of its divisors is an integer number (1073856).
Almost surely, 227030822 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27030822, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34363392).
27030822 is an abundant number, since it is smaller than the sum of its proper divisors (41695962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27030822 is a wasteful number, since it uses less digits than its factorization.
27030822 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1653.
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 27030822 is about 5199.1174251021. The cubic root of 27030822 is about 300.1141121448.
Adding to 27030822 its reverse (22803072), we get a palindrome (49833894).
The spelling of 27030822 in words is "twenty-seven million, thirty thousand, eight hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •