Base | Representation |
---|---|
bin | 110101110011110010… |
… | …0110101000111010100 |
3 | 102001021011212202021201 |
4 | 1223213210311013110 |
5 | 3343123402410312 |
6 | 125030202322244 |
7 | 11230354460263 |
oct | 1534744650724 |
9 | 361234782251 |
10 | 115554341332 |
11 | 4500845aa51 |
12 | 1a48aab9384 |
13 | ab87159001 |
14 | 5842b445da |
15 | 3014a4d557 |
hex | 1ae79351d4 |
115554341332 has 24 divisors (see below), whose sum is σ = 214129598760. Its totient is φ = 54374906880.
The previous prime is 115554341291. The next prime is 115554341339. The reversal of 115554341332 is 233143455511.
115554341332 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 20219133636 + 95335207696 = 142194^2 + 308764^2 .
It is a junction number, because it is equal to n+sod(n) for n = 115554341291 and 115554341300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115554341339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1171782 + ... + 1266562.
It is an arithmetic number, because the mean of its divisors is an integer number (8922066615).
Almost surely, 2115554341332 is an apocalyptic number.
It is an amenable number.
115554341332 is a deficient number, since it is larger than the sum of its proper divisors (98575257428).
115554341332 is a wasteful number, since it uses less digits than its factorization.
115554341332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112731 (or 112729 counting only the distinct ones).
The product of its digits is 108000, while the sum is 37.
Adding to 115554341332 its reverse (233143455511), we get a palindrome (348697796843).
The spelling of 115554341332 in words is "one hundred fifteen billion, five hundred fifty-four million, three hundred forty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •