Base | Representation |
---|---|
bin | 110100001001111001… |
… | …0010111011100000001 |
3 | 101201002112212101221200 |
4 | 1220103302113130001 |
5 | 3313334241320001 |
6 | 123241432411413 |
7 | 11043330545361 |
oct | 1502362273401 |
9 | 351075771850 |
10 | 112001120001 |
11 | 435547921a1 |
12 | 19858b46b69 |
13 | a73bc76c94 |
14 | 55c6c909a1 |
15 | 2da7b2c086 |
hex | 1a13c97701 |
112001120001 has 12 divisors (see below), whose sum is σ = 161782705812. Its totient is φ = 74665885536.
The previous prime is 112001119957. The next prime is 112001120027. The reversal of 112001120001 is 100021100211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 86317852401 + 25683267600 = 293799^2 + 160260^2 .
It is not a de Polignac number, because 112001120001 - 229 = 111464249089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (112001120051) 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 11 ways as a sum of consecutive naturals, for example, 499275 + ... + 687951.
It is an arithmetic number, because the mean of its divisors is an integer number (13481892151).
Almost surely, 2112001120001 is an apocalyptic number.
It is an amenable number.
112001120001 is a deficient number, since it is larger than the sum of its proper divisors (49781585811).
112001120001 is a wasteful number, since it uses less digits than its factorization.
112001120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254640 (or 254637 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112001120001 its reverse (100021100211), we get a palindrome (212022220212).
The spelling of 112001120001 in words is "one hundred twelve billion, one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •