Base | Representation |
---|---|
bin | 1100011000011010011110… |
… | …10111101001110101110101 |
3 | 10120101212222110020220020200 |
4 | 12030031033113221311311 |
5 | 12032042130044240401 |
6 | 133523545344351113 |
7 | 5510044434265266 |
oct | 614151727516565 |
9 | 116355873226220 |
10 | 27227129290101 |
11 | 8747a62746794 |
12 | 3078972615499 |
13 | 12266796396c0 |
14 | 6a1b2b63096d |
15 | 3233905cc686 |
hex | 18c34f5e9d75 |
27227129290101 has 48 divisors (see below), whose sum is σ = 43155950540976. Its totient is φ = 16440007753728.
The previous prime is 27227129290093. The next prime is 27227129290103. The reversal of 27227129290101 is 10109292172272.
27227129290101 is a `hidden beast` number, since 2 + 7 + 2 + 271 + 292 + 90 + 1 + 0 + 1 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 77047880625 + 27150081409476 = 277575^2 + 5210574^2 .
It is not a de Polignac number, because 27227129290101 - 23 = 27227129290093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27227129290103) 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, 6610176 + ... + 9907001.
It is an arithmetic number, because the mean of its divisors is an integer number (899082302937).
Almost surely, 227227129290101 is an apocalyptic number.
It is an amenable number.
27227129290101 is a deficient number, since it is larger than the sum of its proper divisors (15928821250875).
27227129290101 is a wasteful number, since it uses less digits than its factorization.
27227129290101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16517462 (or 16517459 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 45.
The spelling of 27227129290101 in words is "twenty-seven trillion, two hundred twenty-seven billion, one hundred twenty-nine million, two hundred ninety thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •