Base | Representation |
---|---|
bin | 11010001010111011101100… |
… | …101110110110100101101001 |
3 | 120002112111112010010022201202 |
4 | 122022323230232312211221 |
5 | 110041301313324202101 |
6 | 1044444235301453545 |
7 | 33146510551333202 |
oct | 3212735456664551 |
9 | 502474463108652 |
10 | 115100505303401 |
11 | 33746939641772 |
12 | 10aab2ba4112b5 |
13 | 4c2bc14766147 |
14 | 205cc738c05a9 |
15 | d490656d336b |
hex | 68aeecbb6969 |
115100505303401 has 6 divisors (see below), whose sum is σ = 116844063864570. Its totient is φ = 113382587309376.
The previous prime is 115100505303317. The next prime is 115100505303431. The reversal of 115100505303401 is 104303505001511.
It can be written as a sum of positive squares in only one way, i.e., 79024276993600 + 36076228309801 = 8889560^2 + 6006349^2 .
It is not a de Polignac number, because 115100505303401 - 242 = 110702458792297 is a prime.
It is a super-3 number, since 3×1151005053034013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (115100505303431) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12820279016 + ... + 12820287993.
It is an arithmetic number, because the mean of its divisors is an integer number (19474010644095).
Almost surely, 2115100505303401 is an apocalyptic number.
It is an amenable number.
115100505303401 is a deficient number, since it is larger than the sum of its proper divisors (1743558561169).
115100505303401 is an frugal number, since it uses more digits than its factorization.
115100505303401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25640567143 (or 25640567076 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 115100505303401 in words is "one hundred fifteen trillion, one hundred billion, five hundred five million, three hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •