Base | Representation |
---|---|
bin | 10000010011011001101… |
… | …011000100001100011001 |
3 | 10222002210122211201010000 |
4 | 100103121223010030121 |
5 | 121323430410122301 |
6 | 2214402332043213 |
7 | 143641104063444 |
oct | 20233153041431 |
9 | 3862718751100 |
10 | 1120343442201 |
11 | 3a2153736245 |
12 | 161168903509 |
13 | 81856681239 |
14 | 3c32123065b |
15 | 1e22195c786 |
hex | 104d9ac4319 |
1120343442201 has 20 divisors (see below), whose sum is σ = 1673677631824. Its totient is φ = 746860743000.
The previous prime is 1120343442199. The next prime is 1120343442223. The reversal of 1120343442201 is 1022443430211.
1120343442201 is a `hidden beast` number, since 1 + 1 + 2 + 0 + 3 + 434 + 4 + 220 + 1 = 666.
It is not a de Polignac number, because 1120343442201 - 21 = 1120343442199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120343442901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1483926 + ... + 2107776.
Almost surely, 21120343442201 is an apocalyptic number.
It is an amenable number.
1120343442201 is a deficient number, since it is larger than the sum of its proper divisors (553334189623).
1120343442201 is an equidigital number, since it uses as much as digits as its factorization.
1120343442201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646034 (or 646025 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 1120343442201 its reverse (1022443430211), we get a palindrome (2142786872412).
The spelling of 1120343442201 in words is "one trillion, one hundred twenty billion, three hundred forty-three million, four hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •