Base | Representation |
---|---|
bin | 110100001010011111… |
… | …0001101001100110101 |
3 | 101201010221021110120110 |
4 | 1220110332031030311 |
5 | 3313404334013023 |
6 | 123243422453233 |
7 | 11043661540455 |
oct | 1502476151465 |
9 | 351127243513 |
10 | 112021001013 |
11 | 43564a31089 |
12 | 19863734219 |
13 | a7431181ac |
14 | 55c9787d65 |
15 | 2da9757a93 |
hex | 1a14f8d335 |
112021001013 has 8 divisors (see below), whose sum is σ = 151590608608. Its totient is φ = 73566030384.
The previous prime is 112021000961. The next prime is 112021001069. The reversal of 112021001013 is 310100120211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112021001013 - 210 = 112020999989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112021001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112021001083) 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 7 ways as a sum of consecutive naturals, for example, 278659006 + ... + 278659407.
It is an arithmetic number, because the mean of its divisors is an integer number (18948826076).
Almost surely, 2112021001013 is an apocalyptic number.
It is an amenable number.
112021001013 is a deficient number, since it is larger than the sum of its proper divisors (39569607595).
112021001013 is an equidigital number, since it uses as much as digits as its factorization.
112021001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557318483.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 112021001013 its reverse (310100120211), we get a palindrome (422121121224).
The spelling of 112021001013 in words is "one hundred twelve billion, twenty-one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •