Base | Representation |
---|---|
bin | 11001010001100100… |
… | …000001001100001110 |
3 | 2121001022022102020220 |
4 | 121101210001030032 |
5 | 421034334402314 |
6 | 20244521452210 |
7 | 1650336616410 |
oct | 312144011416 |
9 | 77038272226 |
10 | 27138200334 |
11 | 10566896643 |
12 | 5314641066 |
13 | 273650aa0b |
14 | 14563389b0 |
15 | a8c7833a9 |
hex | 65190130e |
27138200334 has 64 divisors (see below), whose sum is σ = 63792537600. Its totient is φ = 7535293920.
The previous prime is 27138200333. The next prime is 27138200339. The reversal of 27138200334 is 43300283172.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27138200295 and 27138200304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27138200333) 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, 321639 + ... + 397149.
It is an arithmetic number, because the mean of its divisors is an integer number (996758400).
Almost surely, 227138200334 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27138200334, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31896268800).
27138200334 is an abundant number, since it is smaller than the sum of its proper divisors (36654337266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27138200334 is a wasteful number, since it uses less digits than its factorization.
27138200334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75765.
The product of its (nonzero) digits is 24192, while the sum is 33.
The spelling of 27138200334 in words is "twenty-seven billion, one hundred thirty-eight million, two hundred thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •