Base | Representation |
---|---|
bin | 11001010001000001100101… |
… | …101101000101110000101001 |
3 | 112120110001222112100211010210 |
4 | 121101001211231011300221 |
5 | 104031102003122413001 |
6 | 1032200154555531333 |
7 | 32256143311142232 |
oct | 3121014555056051 |
9 | 476401875324123 |
10 | 111121100201001 |
11 | 32452215162530 |
12 | 1056801b759b49 |
13 | 4a008a0675667 |
14 | 1d6240b882089 |
15 | cca7ac804dd6 |
hex | 651065b45c29 |
111121100201001 has 8 divisors (see below), whose sum is σ = 161630691201504. Its totient is φ = 67346121333920.
The previous prime is 111121100200991. The next prime is 111121100201003. The reversal of 111121100201001 is 100102001121111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111121100201001 - 29 = 111121100200489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (111121100201003) 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, 1683653033316 + ... + 1683653033381.
It is an arithmetic number, because the mean of its divisors is an integer number (20203836400188).
Almost surely, 2111121100201001 is an apocalyptic number.
111121100201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111121100201001 is a deficient number, since it is larger than the sum of its proper divisors (50509591000503).
111121100201001 is a wasteful number, since it uses less digits than its factorization.
111121100201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3367306066711.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111121100201001 its reverse (100102001121111), we get a palindrome (211223101322112).
The spelling of 111121100201001 in words is "one hundred eleven trillion, one hundred twenty-one billion, one hundred million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •