Base | Representation |
---|---|
bin | 11010001100011000101010… |
… | …010111000110001100000010 |
3 | 120002220001011121200122202010 |
4 | 122030120222113012030002 |
5 | 110044420230304323132 |
6 | 1045002144212233350 |
7 | 33156643260156630 |
oct | 3214305227061402 |
9 | 502801147618663 |
10 | 115200323511042 |
11 | 337852013a0550 |
12 | 10b0671730b856 |
13 | 4c384616c4c33 |
14 | 2063a2273c350 |
15 | d4b9589ad6cc |
hex | 68c62a5c6302 |
115200323511042 has 64 divisors (see below), whose sum is σ = 289155091027968. Its totient is φ = 29724001920000.
The previous prime is 115200323511001. The next prime is 115200323511043. The reversal of 115200323511042 is 240115323002511.
It is a happy number.
It is a super-2 number, since 2×1152003235110422 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (115200323511043) 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 31 ways as a sum of consecutive naturals, for example, 825596959 + ... + 825736482.
It is an arithmetic number, because the mean of its divisors is an integer number (4518048297312).
Almost surely, 2115200323511042 is an apocalyptic number.
115200323511042 is an abundant number, since it is smaller than the sum of its proper divisors (173954767516926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115200323511042 is a wasteful number, since it uses less digits than its factorization.
115200323511042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1651333615.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 115200323511042 its reverse (240115323002511), we get a palindrome (355315646513553).
The spelling of 115200323511042 in words is "one hundred fifteen trillion, two hundred billion, three hundred twenty-three million, five hundred eleven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •