Base | Representation |
---|---|
bin | 110101101111100011… |
… | …1011000100010000000 |
3 | 102000220021210121100112 |
4 | 1223133013120202000 |
5 | 3342331033414402 |
6 | 125004132210452 |
7 | 11224012151660 |
oct | 1533707304200 |
9 | 360807717315 |
10 | 115412404352 |
11 | 44a45325663 |
12 | 1a44b469a28 |
13 | ab6392112b |
14 | 582bd581a0 |
15 | 3007362e52 |
hex | 1adf1d8880 |
115412404352 has 64 divisors (see below), whose sum is σ = 274194115200. Its totient is φ = 47311908864.
The previous prime is 115412404351. The next prime is 115412404357. The reversal of 115412404352 is 253404214511.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (115412404351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2779577 + ... + 2820792.
It is an arithmetic number, because the mean of its divisors is an integer number (4284283050).
Almost surely, 2115412404352 is an apocalyptic number.
It is an amenable number.
115412404352 is an abundant number, since it is smaller than the sum of its proper divisors (158781710848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115412404352 is an equidigital number, since it uses as much as digits as its factorization.
115412404352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5600413 (or 5600401 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 115412404352 its reverse (253404214511), we get a palindrome (368816618863).
The spelling of 115412404352 in words is "one hundred fifteen billion, four hundred twelve million, four hundred four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •