Base | Representation |
---|---|
bin | 110101110000110101… |
… | …1000010000101000000 |
3 | 102001000021112010121101 |
4 | 1223201223002011000 |
5 | 3342423024212000 |
6 | 125012303504144 |
7 | 11225042614561 |
oct | 1534153020500 |
9 | 361007463541 |
10 | 115455304000 |
11 | 44a67566813 |
12 | 1a4618b8054 |
13 | ab6c79173a |
14 | 5833924168 |
15 | 300aed8e6a |
hex | 1ae1ac2140 |
115455304000 has 56 divisors (see below), whose sum is σ = 285925080168. Its totient is φ = 46182118400.
The previous prime is 115455303949. The next prime is 115455304037. The reversal of 115455304000 is 403554511.
It can be written as a sum of positive squares in 4 ways, for example, as 21559636224 + 93895667776 = 146832^2 + 306424^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 115455304000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7207957 + ... + 7223956.
It is an arithmetic number, because the mean of its divisors is an integer number (5105805003).
Almost surely, 2115455304000 is an apocalyptic number.
115455304000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115455304000 is an abundant number, since it is smaller than the sum of its proper divisors (170469776168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115455304000 is an equidigital number, since it uses as much as digits as its factorization.
115455304000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14431940 (or 14431920 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 115455304000 its reverse (403554511), we get a palindrome (115858858511).
The spelling of 115455304000 in words is "one hundred fifteen billion, four hundred fifty-five million, three hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •