Base | Representation |
---|---|
bin | 11010001011101100001011… |
… | …000011000011111100111101 |
3 | 120002201110212110000221020210 |
4 | 122023230023003003330331 |
5 | 110043124412200300203 |
6 | 1044524204111503033 |
7 | 33153332424040512 |
oct | 3213541303037475 |
9 | 502643773027223 |
10 | 115152553525053 |
11 | 33766a18497a90 |
12 | 10ab9405227a79 |
13 | 4c33aba965035 |
14 | 20615b025d309 |
15 | d4a5aecb3803 |
hex | 68bb0b0c3f3d |
115152553525053 has 32 divisors (see below), whose sum is σ = 167591741276160. Its totient is φ = 69748964170560.
The previous prime is 115152553524991. The next prime is 115152553525117. The reversal of 115152553525053 is 350525355251511.
It is not a de Polignac number, because 115152553525053 - 28 = 115152553524797 is a prime.
It is a super-2 number, since 2×1151525535250532 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115152553524993 and 115152553525011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115152553525453) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2130967551 + ... + 2131021587.
It is an arithmetic number, because the mean of its divisors is an integer number (5237241914880).
Almost surely, 2115152553525053 is an apocalyptic number.
It is an amenable number.
115152553525053 is a deficient number, since it is larger than the sum of its proper divisors (52439187751107).
115152553525053 is a wasteful number, since it uses less digits than its factorization.
115152553525053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90297.
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 115152553525053 in words is "one hundred fifteen trillion, one hundred fifty-two billion, five hundred fifty-three million, five hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •