Base | Representation |
---|---|
bin | 11010001100110000000010… |
… | …100010011101011100110110 |
3 | 120002222102221222221211111122 |
4 | 122030300002202131130312 |
5 | 110100323132323030141 |
6 | 1045021455104503542 |
7 | 33161522311100162 |
oct | 3214600242353466 |
9 | 502872858854448 |
10 | 115225425205046 |
11 | 33794912675802 |
12 | 10b0b56191abb2 |
13 | 4c3a932016000 |
14 | 2064d243d7ca2 |
15 | d4c42756c64b |
hex | 68cc0289d736 |
115225425205046 has 32 divisors (see below), whose sum is σ = 187237936855200. Its totient is φ = 53180063183520.
The previous prime is 115225425205043. The next prime is 115225425205057. The reversal of 115225425205046 is 640502524522511.
It is a super-2 number, since 2×1152254252050462 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115225425204988 and 115225425205006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115225425205043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 307089320 + ... + 307464308.
It is an arithmetic number, because the mean of its divisors is an integer number (5851185526725).
Almost surely, 2115225425205046 is an apocalyptic number.
115225425205046 is a deficient number, since it is larger than the sum of its proper divisors (72012511650154).
115225425205046 is an equidigital number, since it uses as much as digits as its factorization.
115225425205046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444961 (or 444935 counting only the distinct ones).
The product of its (nonzero) digits is 960000, while the sum is 44.
Adding to 115225425205046 its reverse (640502524522511), we get a palindrome (755727949727557).
The spelling of 115225425205046 in words is "one hundred fifteen trillion, two hundred twenty-five billion, four hundred twenty-five million, two hundred five thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •