Base | Representation |
---|---|
bin | 10000100110101010000… |
… | …110101110011000011001 |
3 | 11001002011122212000002022 |
4 | 100212222012232120121 |
5 | 122143302134114001 |
6 | 2232102155144225 |
7 | 145302354604301 |
oct | 20465206563031 |
9 | 4032148760068 |
10 | 1141020223001 |
11 | 3aa9a419573a |
12 | 165179445075 |
13 | 837a0328789 |
14 | 3d323368601 |
15 | 1ea31d1111b |
hex | 109aa1ae619 |
1141020223001 has 4 divisors (see below), whose sum is σ = 1141249671012. Its totient is φ = 1140790774992.
The previous prime is 1141020222971. The next prime is 1141020223003. The reversal of 1141020223001 is 1003220201411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 942617683225 + 198402539776 = 970885^2 + 445424^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1141020223001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1141020223003) 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, 114716546 + ... + 114726491.
It is an arithmetic number, because the mean of its divisors is an integer number (285312417753).
Almost surely, 21141020223001 is an apocalyptic number.
It is an amenable number.
1141020223001 is a deficient number, since it is larger than the sum of its proper divisors (229448011).
1141020223001 is an equidigital number, since it uses as much as digits as its factorization.
1141020223001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229448010.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1141020223001 its reverse (1003220201411), we get a palindrome (2144240424412).
The spelling of 1141020223001 in words is "one trillion, one hundred forty-one billion, twenty million, two hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •