Base | Representation |
---|---|
bin | 11010101011000010111101… |
… | …110001001101101010111111 |
3 | 120101100110201120012222222002 |
4 | 122223002331301031222333 |
5 | 110333430403112130411 |
6 | 1053254124350212515 |
7 | 33465114002606255 |
oct | 3253027561155277 |
9 | 511313646188862 |
10 | 117307330583231 |
11 | 34417839a11488 |
12 | 111a6b437b413b |
13 | 505c0593799a9 |
14 | 20d79c2aca5d5 |
15 | d86675e3a33b |
hex | 6ab0bdc4dabf |
117307330583231 has 4 divisors (see below), whose sum is σ = 121352410948200. Its totient is φ = 113262250218264.
The previous prime is 117307330583227. The next prime is 117307330583237. The reversal of 117307330583231 is 132385033703711.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 117307330583231 - 22 = 117307330583227 is a prime.
It is a super-2 number, since 2×1173073305832312 (a number of 29 digits) 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 (117307330583237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2022540182441 + ... + 2022540182498.
It is an arithmetic number, because the mean of its divisors is an integer number (30338102737050).
Almost surely, 2117307330583231 is an apocalyptic number.
117307330583231 is a deficient number, since it is larger than the sum of its proper divisors (4045080364969).
117307330583231 is an equidigital number, since it uses as much as digits as its factorization.
117307330583231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4045080364968.
The product of its (nonzero) digits is 952560, while the sum is 47.
The spelling of 117307330583231 in words is "one hundred seventeen trillion, three hundred seven billion, three hundred thirty million, five hundred eighty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •