Base | Representation |
---|---|
bin | 11001100101111001011010… |
… | …000101010110101011100011 |
3 | 112202112012020001020010012021 |
4 | 121211321122011112223203 |
5 | 104223102002110441120 |
6 | 1035215125331242311 |
7 | 32464601225004655 |
oct | 3145713205265343 |
9 | 482465201203167 |
10 | 112555424312035 |
11 | 3295553a78a431 |
12 | 10759bb3a49397 |
13 | 4aa5c144564b3 |
14 | 1db19d68d86d5 |
15 | d02c58ed6aaa |
hex | 665e5a156ae3 |
112555424312035 has 8 divisors (see below), whose sum is σ = 135066570114816. Its totient is φ = 90044298822720.
The previous prime is 112555424312017. The next prime is 112555424312039. The reversal of 112555424312035 is 530213424555211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112555424312035 - 27 = 112555424311907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112555424311982 and 112555424312000.
It is not an unprimeable number, because it can be changed into a prime (112555424312039) 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, 12893695 + ... + 19782775.
It is an arithmetic number, because the mean of its divisors is an integer number (16883321264352).
Almost surely, 2112555424312035 is an apocalyptic number.
112555424312035 is a deficient number, since it is larger than the sum of its proper divisors (22511145802781).
112555424312035 is an equidigital number, since it uses as much as digits as its factorization.
112555424312035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10156733.
The product of its (nonzero) digits is 720000, while the sum is 43.
Adding to 112555424312035 its reverse (530213424555211), we get a palindrome (642768848867246).
The spelling of 112555424312035 in words is "one hundred twelve trillion, five hundred fifty-five billion, four hundred twenty-four million, three hundred twelve thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •