Base | Representation |
---|---|
bin | 11010001011000111111010… |
… | …110000110100110010111111 |
3 | 120002120202101111021121120200 |
4 | 122023013322300310302333 |
5 | 110042010201123301023 |
6 | 1044454245231214543 |
7 | 33150453645131250 |
oct | 3213077260646277 |
9 | 502522344247520 |
10 | 115113625603263 |
11 | 337514617131a1 |
12 | 10ab1960377453 |
13 | 4c30225a383a1 |
14 | 205d75a202b27 |
15 | d49582499743 |
hex | 68b1fac34cbf |
115113625603263 has 48 divisors (see below), whose sum is σ = 194454053713920. Its totient is φ = 64247504069952.
The previous prime is 115113625603243. The next prime is 115113625603271. The reversal of 115113625603263 is 362306526311511.
115113625603263 is a `hidden beast` number, since 1 + 1 + 5 + 1 + 1 + 3 + 62 + 560 + 3 + 26 + 3 = 666.
It is not a de Polignac number, because 115113625603263 - 225 = 115113592048831 is a prime.
It is a super-2 number, since 2×1151136256032632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115113625603243) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 90469170 + ... + 91732752.
It is an arithmetic number, because the mean of its divisors is an integer number (4051126119040).
Almost surely, 2115113625603263 is an apocalyptic number.
115113625603263 is a deficient number, since it is larger than the sum of its proper divisors (79340428110657).
115113625603263 is a wasteful number, since it uses less digits than its factorization.
115113625603263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297268 (or 1297265 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The spelling of 115113625603263 in words is "one hundred fifteen trillion, one hundred thirteen billion, six hundred twenty-five million, six hundred three thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •