Base | Representation |
---|---|
bin | 11010010001011000001100… |
… | …101001001010101101000010 |
3 | 120011002211202202121210022220 |
4 | 122101120030221022231002 |
5 | 110121030412103042310 |
6 | 1045423525422311510 |
7 | 33223510500661032 |
oct | 3221301451125502 |
9 | 504084682553286 |
10 | 115543422315330 |
11 | 338a7765760369 |
12 | 10b6110a428596 |
13 | 4c6190c5a2aa9 |
14 | 207648d8138c2 |
15 | d55839c13670 |
hex | 69160ca4ab42 |
115543422315330 has 96 divisors (see below), whose sum is σ = 280040404939200. Its totient is φ = 30508875767040.
The previous prime is 115543422315329. The next prime is 115543422315337. The reversal of 115543422315330 is 33513224345511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115543422315337) 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 in 47 ways as a sum of consecutive naturals, for example, 13074955672 + ... + 13074964508.
It is an arithmetic number, because the mean of its divisors is an integer number (2917087551450).
Almost surely, 2115543422315330 is an apocalyptic number.
115543422315330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115543422315330 is an abundant number, since it is smaller than the sum of its proper divisors (164496982623870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115543422315330 is an frugal number, since it uses more digits than its factorization.
115543422315330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18164 (or 9327 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 42.
The spelling of 115543422315330 in words is "one hundred fifteen trillion, five hundred forty-three billion, four hundred twenty-two million, three hundred fifteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •