Base | Representation |
---|---|
bin | 110100010000001011… |
… | …1101100001101011001 |
3 | 101201122021002221210121 |
4 | 1220200113230031121 |
5 | 3314302312343001 |
6 | 123314413313241 |
7 | 11051503140343 |
oct | 1504027541531 |
9 | 351567087717 |
10 | 112212231001 |
11 | 43652973aa2 |
12 | 198b7795821 |
13 | a773921730 |
14 | 5606d26293 |
15 | 2dbb42d6a1 |
hex | 1a205ec359 |
112212231001 has 8 divisors (see below), whose sum is σ = 120855143304. Its totient is φ = 103570919040.
The previous prime is 112212230987. The next prime is 112212231083. The reversal of 112212231001 is 100132212211.
It can be written as a sum of positive squares in 4 ways, for example, as 58213625625 + 53998605376 = 241275^2 + 232376^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112212231001 - 215 = 112212198233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112212231101) 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 7 ways as a sum of consecutive naturals, for example, 252430 + ... + 536791.
It is an arithmetic number, because the mean of its divisors is an integer number (15106892913).
Almost surely, 2112212231001 is an apocalyptic number.
It is an amenable number.
112212231001 is a deficient number, since it is larger than the sum of its proper divisors (8642912303).
112212231001 is a wasteful number, since it uses less digits than its factorization.
112212231001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 800171.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 112212231001 its reverse (100132212211), we get a palindrome (212344443212).
The spelling of 112212231001 in words is "one hundred twelve billion, two hundred twelve million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •