Base | Representation |
---|---|
bin | 1100011000001000011010… |
… | …10010010111111010111011 |
3 | 10120100221221112121012122211 |
4 | 12030010031102113322323 |
5 | 12031412244223101011 |
6 | 133515303125355551 |
7 | 5506252206362014 |
oct | 614041522277273 |
9 | 116327845535584 |
10 | 27217430675131 |
11 | 8743936071814 |
12 | 3076b06568bb7 |
13 | 1225792213588 |
14 | 6a148b52200b |
15 | 322ec3e03b21 |
hex | 18c10d497ebb |
27217430675131 has 8 divisors (see below), whose sum is σ = 27953287383440. Its totient is φ = 26481587149728.
The previous prime is 27217430675129. The next prime is 27217430675143. The reversal of 27217430675131 is 13157603471272.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 27217430675131 - 21 = 27217430675129 is a prime.
It is a super-2 number, since 2×272174306751312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27217430675431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 962680 + ... + 7440538.
It is an arithmetic number, because the mean of its divisors is an integer number (3494160922930).
Almost surely, 227217430675131 is an apocalyptic number.
27217430675131 is a deficient number, since it is larger than the sum of its proper divisors (735856708309).
27217430675131 is a wasteful number, since it uses less digits than its factorization.
27217430675131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6591453.
The product of its (nonzero) digits is 1481760, while the sum is 49.
The spelling of 27217430675131 in words is "twenty-seven trillion, two hundred seventeen billion, four hundred thirty million, six hundred seventy-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •