Base | Representation |
---|---|
bin | 110100001101100010… |
… | …1011000010110101001 |
3 | 101201102002020020110221 |
4 | 1220123011120112221 |
5 | 3314112111420001 |
6 | 123301524410041 |
7 | 11046345256516 |
oct | 1503305302651 |
9 | 351362206427 |
10 | 112123545001 |
11 | 436078aa986 |
12 | 19891b46921 |
13 | a75b43c900 |
14 | 55d923c30d |
15 | 2db37611a1 |
hex | 1a1b1585a9 |
112123545001 has 6 divisors (see below), whose sum is σ = 121411886190. Its totient is φ = 103498656768.
The previous prime is 112123544921. The next prime is 112123545013. The reversal of 112123545001 is 100545321211.
It can be written as a sum of positive squares in 3 ways, for example, as 850597225 + 111272947776 = 29165^2 + 333576^2 .
It is not a de Polignac number, because 112123545001 - 27 = 112123544873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112123545041) 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 5 ways as a sum of consecutive naturals, for example, 331726296 + ... + 331726633.
It is an arithmetic number, because the mean of its divisors is an integer number (20235314365).
Almost surely, 2112123545001 is an apocalyptic number.
It is an amenable number.
112123545001 is a deficient number, since it is larger than the sum of its proper divisors (9288341189).
112123545001 is an equidigital number, since it uses as much as digits as its factorization.
112123545001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663452955 (or 663452942 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 112123545001 its reverse (100545321211), we get a palindrome (212668866212).
The spelling of 112123545001 in words is "one hundred twelve billion, one hundred twenty-three million, five hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •