Base | Representation |
---|---|
bin | 11001010001000010100111… |
… | …010000100100100011010001 |
3 | 112120110011211011212110211021 |
4 | 121101002213100210203101 |
5 | 104031111231201134301 |
6 | 1032200500044515441 |
7 | 32256212464356145 |
oct | 3121024720444321 |
9 | 476404734773737 |
10 | 111122200021201 |
11 | 32452729a64746 |
12 | 10568287b4bb81 |
13 | 4a00a17492545 |
14 | 1d624b3975225 |
15 | cca8241528a1 |
hex | 6510a74248d1 |
111122200021201 has 4 divisors (see below), whose sum is σ = 112160725255152. Its totient is φ = 110083674787252.
The previous prime is 111122200021153. The next prime is 111122200021331. The reversal of 111122200021201 is 102120002221111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111122200021201 - 215 = 111122199988433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111122200022201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 519262616815 + ... + 519262617028.
It is an arithmetic number, because the mean of its divisors is an integer number (28040181313788).
Almost surely, 2111122200021201 is an apocalyptic number.
It is an amenable number.
111122200021201 is a deficient number, since it is larger than the sum of its proper divisors (1038525233951).
111122200021201 is a wasteful number, since it uses less digits than its factorization.
111122200021201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1038525233950.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 111122200021201 its reverse (102120002221111), we get a palindrome (213242202242312).
The spelling of 111122200021201 in words is "one hundred eleven trillion, one hundred twenty-two billion, two hundred million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •