Base | Representation |
---|---|
bin | 110101100100011110… |
… | …0000110111111000111 |
3 | 101222221100201021221022 |
4 | 1223020330012333013 |
5 | 3341100312201101 |
6 | 124503201541355 |
7 | 11211543561566 |
oct | 1531074067707 |
9 | 358840637838 |
10 | 115040350151 |
11 | 44874307851 |
12 | 1a36694485b |
13 | ab0481580c |
14 | 57d4789bdd |
15 | 2ed486ea1b |
hex | 1ac8f06fc7 |
115040350151 has 2 divisors, whose sum is σ = 115040350152. Its totient is φ = 115040350150.
The previous prime is 115040350049. The next prime is 115040350171. The reversal of 115040350151 is 151053040511.
It is a strong prime.
It is an emirp because it is prime and its reverse (151053040511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115040350151 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115040350151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115040350171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57520175075 + 57520175076.
It is an arithmetic number, because the mean of its divisors is an integer number (57520175076).
Almost surely, 2115040350151 is an apocalyptic number.
115040350151 is a deficient number, since it is larger than the sum of its proper divisors (1).
115040350151 is an equidigital number, since it uses as much as digits as its factorization.
115040350151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 115040350151 its reverse (151053040511), we get a palindrome (266093390662).
The spelling of 115040350151 in words is "one hundred fifteen billion, forty million, three hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •