Base | Representation |
---|---|
bin | 110100010100000001… |
… | …1000011111110011111 |
3 | 101201222020111011222100 |
4 | 1220220003003332133 |
5 | 3320033301303210 |
6 | 123335254220143 |
7 | 11054626044015 |
oct | 1505003037637 |
9 | 351866434870 |
10 | 112341041055 |
11 | 43709652991 |
12 | 19932954653 |
13 | a7945116b9 |
14 | 561a0968b5 |
15 | 2dc78c45c0 |
hex | 1a280c3f9f |
112341041055 has 24 divisors (see below), whose sum is σ = 194737458240. Its totient is φ = 59911225920.
The previous prime is 112341041053. The next prime is 112341041117. The reversal of 112341041055 is 550140143211.
112341041055 is a `hidden beast` number, since 1 + 1 + 234 + 10 + 410 + 5 + 5 = 666.
It is not a de Polignac number, because 112341041055 - 21 = 112341041053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112341041051) 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 23 ways as a sum of consecutive naturals, for example, 674826 + ... + 824664.
It is an arithmetic number, because the mean of its divisors is an integer number (8114060760).
Almost surely, 2112341041055 is an apocalyptic number.
112341041055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
112341041055 is a deficient number, since it is larger than the sum of its proper divisors (82396417185).
112341041055 is a wasteful number, since it uses less digits than its factorization.
112341041055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166511 (or 166508 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 112341041055 its reverse (550140143211), we get a palindrome (662481184266).
The spelling of 112341041055 in words is "one hundred twelve billion, three hundred forty-one million, forty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •