Base | Representation |
---|---|
bin | 1101101111111… |
… | …00110111100011 |
3 | 22001000101202011 |
4 | 12313330313203 |
5 | 214011034111 |
6 | 15235533351 |
7 | 2600202421 |
oct | 667746743 |
9 | 261011664 |
10 | 115330531 |
11 | 5a112598 |
12 | 3275a257 |
13 | 1ab80724 |
14 | 11462111 |
15 | a1d2021 |
hex | 6dfcde3 |
115330531 has 2 divisors, whose sum is σ = 115330532. Its totient is φ = 115330530.
The previous prime is 115330529. The next prime is 115330541. The reversal of 115330531 is 135033511.
It is a weak prime.
It is an emirp because it is prime and its reverse (135033511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115330531 - 21 = 115330529 is a prime.
It is a super-3 number, since 3×1153305313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 115330529, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (115330541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57665265 + 57665266.
It is an arithmetic number, because the mean of its divisors is an integer number (57665266).
Almost surely, 2115330531 is an apocalyptic number.
115330531 is a deficient number, since it is larger than the sum of its proper divisors (1).
115330531 is an equidigital number, since it uses as much as digits as its factorization.
115330531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 22.
The square root of 115330531 is about 10739.2053244176. The cubic root of 115330531 is about 486.7598671089.
It can be divided in two parts, 1153 and 30531, that added together give a square (31684 = 1782).
The spelling of 115330531 in words is "one hundred fifteen million, three hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •