Base | Representation |
---|---|
bin | 110101100110010010… |
… | …1001100111011001111 |
3 | 102000002121200200200222 |
4 | 1223030211030323033 |
5 | 3341211433012111 |
6 | 124513223341555 |
7 | 11213215134164 |
oct | 1531445147317 |
9 | 360077620628 |
10 | 115101454031 |
11 | 448a5852023 |
12 | 1a3832b18bb |
13 | ab1438b065 |
14 | 57dc93406b |
15 | 2ed9dde7db |
hex | 1acc94cecf |
115101454031 has 4 divisors (see below), whose sum is σ = 116678186352. Its totient is φ = 113524721712.
The previous prime is 115101454009. The next prime is 115101454037. The reversal of 115101454031 is 130454101511.
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 115101454031 - 26 = 115101453967 is a prime.
It is a super-2 number, since 2×1151014540312 (a number of 23 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 (115101454037) 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, 788366051 + ... + 788366196.
It is an arithmetic number, because the mean of its divisors is an integer number (29169546588).
Almost surely, 2115101454031 is an apocalyptic number.
115101454031 is a deficient number, since it is larger than the sum of its proper divisors (1576732321).
115101454031 is an equidigital number, since it uses as much as digits as its factorization.
115101454031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1576732320.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 115101454031 its reverse (130454101511), we get a palindrome (245555555542).
The spelling of 115101454031 in words is "one hundred fifteen billion, one hundred one million, four hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •