Base | Representation |
---|---|
bin | 110101100011111000… |
… | …0100111101101010000 |
3 | 101222212222110220122101 |
4 | 1223013300213231100 |
5 | 3341030230424412 |
6 | 124501213450144 |
7 | 11211213432133 |
oct | 1530760475520 |
9 | 358788426571 |
10 | 115020561232 |
11 | 44864121075 |
12 | 1a3601a0954 |
13 | ab006a74b5 |
14 | 57d1cb821a |
15 | 2ed2c61457 |
hex | 1ac7c27b50 |
115020561232 has 10 divisors (see below), whose sum is σ = 222852337418. Its totient is φ = 57510280608.
The previous prime is 115020561211. The next prime is 115020561233. The reversal of 115020561232 is 232165020511.
It can be written as a sum of positive squares in only one way, i.e., 95421681216 + 19598880016 = 308904^2 + 139996^2 .
It is a super-2 number, since 2×1150205612322 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 115020561232.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115020561233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3594392523 + ... + 3594392554.
Almost surely, 2115020561232 is an apocalyptic number.
It is an amenable number.
115020561232 is a deficient number, since it is larger than the sum of its proper divisors (107831776186).
115020561232 is an equidigital number, since it uses as much as digits as its factorization.
115020561232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7188785085 (or 7188785079 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 115020561232 its reverse (232165020511), we get a palindrome (347185581743).
The spelling of 115020561232 in words is "one hundred fifteen billion, twenty million, five hundred sixty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •