Base | Representation |
---|---|
bin | 11001011111100100110100… |
… | …011000000111110111101001 |
3 | 112200222122220021020120001201 |
4 | 121133210310120013313221 |
5 | 104143442302000013001 |
6 | 1034243402030444201 |
7 | 32421321621204055 |
oct | 3137446430076751 |
9 | 480878807216051 |
10 | 112121000001001 |
11 | 327a828156a702 |
12 | 106a9974063661 |
13 | 4a73c70c5a654 |
14 | 1d98984884c65 |
15 | ce67d0377501 |
hex | 65f934607de9 |
112121000001001 has 8 divisors (see below), whose sum is σ = 113231372419008. Its totient is φ = 111010632750000.
The previous prime is 112121000000953. The next prime is 112121000001067. The reversal of 112121000001001 is 100100000121211.
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 112121000001001 - 217 = 112120999869929 is a prime.
It is a super-2 number, since 2×1121210000010012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112121000001071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53970076 + ... + 56009026.
It is an arithmetic number, because the mean of its divisors is an integer number (14153921552376).
Almost surely, 2112121000001001 is an apocalyptic number.
It is an amenable number.
112121000001001 is a deficient number, since it is larger than the sum of its proper divisors (1110372418007).
112121000001001 is a wasteful number, since it uses less digits than its factorization.
112121000001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2583503.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 112121000001001 its reverse (100100000121211), we get a palindrome (212221000122212).
The spelling of 112121000001001 in words is "one hundred twelve trillion, one hundred twenty-one billion, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •