Base | Representation |
---|---|
bin | 1100010100011100010001… |
… | …00101101111111100000011 |
3 | 10112220211201000000112020012 |
4 | 12022032020211233330003 |
5 | 12022323122441123211 |
6 | 133341134542535135 |
7 | 5464143366300053 |
oct | 612161045577403 |
9 | 115824630015205 |
10 | 27090650332931 |
11 | 86a50979521a9 |
12 | 3056423b974ab |
13 | 12168393a1003 |
14 | 6992a18bb563 |
15 | 31ea53a72d8b |
hex | 18a38896ff03 |
27090650332931 has 8 divisors (see below), whose sum is σ = 28697678487504. Its totient is φ = 25485117788160.
The previous prime is 27090650332919. The next prime is 27090650332939. The reversal of 27090650332931 is 13923305609072.
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 27090650332931 - 218 = 27090650070787 is a prime.
It is a super-2 number, since 2×270906503329312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 27090650332931.
It is not an unprimeable number, because it can be changed into a prime (27090650332939) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 373865150 + ... + 373937603.
It is an arithmetic number, because the mean of its divisors is an integer number (3587209810938).
Almost surely, 227090650332931 is an apocalyptic number.
27090650332931 is a deficient number, since it is larger than the sum of its proper divisors (1607028154573).
27090650332931 is a wasteful number, since it uses less digits than its factorization.
27090650332931 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 747804901.
The product of its (nonzero) digits is 1837080, while the sum is 50.
The spelling of 27090650332931 in words is "twenty-seven trillion, ninety billion, six hundred fifty million, three hundred thirty-two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •