Base | Representation |
---|---|
bin | 10000000011101000011… |
… | …110110100101011110001 |
3 | 10220111002200101102222222 |
4 | 100003220132310223301 |
5 | 121034241434201001 |
6 | 2202522301010425 |
7 | 142501402302362 |
oct | 20035036645361 |
9 | 3814080342888 |
10 | 1103412022001 |
11 | 395a55358693 |
12 | 159a22553a15 |
13 | 800889500c3 |
14 | 3b5966c3b69 |
15 | 1da802d061b |
hex | 100e87b4af1 |
1103412022001 has 4 divisors (see below), whose sum is σ = 1116706142832. Its totient is φ = 1090117901172.
The previous prime is 1103412021953. The next prime is 1103412022033. The reversal of 1103412022001 is 1002202143011.
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 1103412022001 - 226 = 1103344913137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103412022081) 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 3 ways as a sum of consecutive naturals, for example, 6647060291 + ... + 6647060456.
It is an arithmetic number, because the mean of its divisors is an integer number (279176535708).
Almost surely, 21103412022001 is an apocalyptic number.
It is an amenable number.
1103412022001 is a deficient number, since it is larger than the sum of its proper divisors (13294120831).
1103412022001 is an equidigital number, since it uses as much as digits as its factorization.
1103412022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13294120830.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1103412022001 its reverse (1002202143011), we get a palindrome (2105614165012).
The spelling of 1103412022001 in words is "one trillion, one hundred three billion, four hundred twelve million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •