Base | Representation |
---|---|
bin | 10110110011100… |
… | …10110000000111 |
3 | 111022222121011020 |
4 | 23121302300013 |
5 | 342433421410 |
6 | 30552242223 |
7 | 4512054411 |
oct | 1331626007 |
9 | 438877136 |
10 | 191310855 |
11 | 98a9874a |
12 | 540a0373 |
13 | 308342b8 |
14 | 1b59d9b1 |
15 | 11bdea70 |
hex | b672c07 |
191310855 has 8 divisors (see below), whose sum is σ = 306097392. Its totient is φ = 102032448.
The previous prime is 191310853. The next prime is 191310857. The reversal of 191310855 is 558013191.
191310855 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (191310853) and next prime (191310857).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 191310855 - 21 = 191310853 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (191310853) 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, 6377014 + ... + 6377043.
It is an arithmetic number, because the mean of its divisors is an integer number (38262174).
Almost surely, 2191310855 is an apocalyptic number.
191310855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
191310855 is a deficient number, since it is larger than the sum of its proper divisors (114786537).
191310855 is a wasteful number, since it uses less digits than its factorization.
191310855 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12754065.
The product of its (nonzero) digits is 5400, while the sum is 33.
The square root of 191310855 is about 13831.5167281105. The cubic root of 191310855 is about 576.2087790855.
The spelling of 191310855 in words is "one hundred ninety-one million, three hundred ten thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •