Base | Representation |
---|---|
bin | 110011111010… |
… | …0100010001101 |
3 | 1220012201100111 |
4 | 1213310202031 |
5 | 23431403023 |
6 | 2411200021 |
7 | 450221656 |
oct | 147644215 |
9 | 56181314 |
10 | 27216013 |
11 | 143a9880 |
12 | 9146011 |
13 | 583ba66 |
14 | 388652d |
15 | 25c900d |
hex | 19f488d |
27216013 has 4 divisors (see below), whose sum is σ = 29690208. Its totient is φ = 24741820.
The previous prime is 27216011. The next prime is 27216017. The reversal of 27216013 is 31061272.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 27216013 - 21 = 27216011 is a prime.
It is a super-2 number, since 2×272160132 = 1481422727232338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27216011) 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 3 ways as a sum of consecutive naturals, for example, 1237081 + ... + 1237102.
It is an arithmetic number, because the mean of its divisors is an integer number (7422552).
Almost surely, 227216013 is an apocalyptic number.
It is an amenable number.
27216013 is a deficient number, since it is larger than the sum of its proper divisors (2474195).
27216013 is a wasteful number, since it uses less digits than its factorization.
27216013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2474194.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 27216013 is about 5216.8968745798. The cubic root of 27216013 is about 300.7979239909.
Adding to 27216013 its reverse (31061272), we get a palindrome (58277285).
The spelling of 27216013 in words is "twenty-seven million, two hundred sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •