Base | Representation |
---|---|
bin | 10000001011111010010… |
… | …100011001000101100001 |
3 | 10221100001011222002021020 |
4 | 100023322110121011201 |
5 | 121210443102241001 |
6 | 2210552323120053 |
7 | 143234601206250 |
oct | 20137224310541 |
9 | 3840034862236 |
10 | 1112301212001 |
11 | 3997a7044701 |
12 | 15b6a3513029 |
13 | 80b74473445 |
14 | 3bb9b0d2797 |
15 | 1de008be736 |
hex | 102fa519161 |
1112301212001 has 8 divisors (see below), whose sum is σ = 1694935180224. Its totient is φ = 635600692560.
The previous prime is 1112301211949. The next prime is 1112301212017. The reversal of 1112301212001 is 1002121032111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1112301212001 - 211 = 1112301209953 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1112301212051) 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, 26483362170 + ... + 26483362211.
It is an arithmetic number, because the mean of its divisors is an integer number (211866897528).
Almost surely, 21112301212001 is an apocalyptic number.
It is an amenable number.
1112301212001 is a deficient number, since it is larger than the sum of its proper divisors (582633968223).
1112301212001 is an equidigital number, since it uses as much as digits as its factorization.
1112301212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52966724391.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1112301212001 its reverse (1002121032111), we get a palindrome (2114422244112).
It can be divided in two parts, 111230 and 1212001, that added together give a palindrome (1323231).
The spelling of 1112301212001 in words is "one trillion, one hundred twelve billion, three hundred one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •