Base | Representation |
---|---|
bin | 10000010100001100110… |
… | …000000111001100000001 |
3 | 10222012000101100211121022 |
4 | 100110030300013030001 |
5 | 121332204300400301 |
6 | 2215023343435225 |
7 | 144001251116144 |
oct | 20241460071401 |
9 | 3865011324538 |
10 | 1121200403201 |
11 | 3a255344177a |
12 | 1613678b5b15 |
13 | 81962088a58 |
14 | 3c3a2d8605b |
15 | 1e271cd6d1b |
hex | 1050cc07301 |
1121200403201 has 16 divisors (see below), whose sum is σ = 1163807274240. Its totient is φ = 1078857823680.
The previous prime is 1121200403161. The next prime is 1121200403243. The reversal of 1121200403201 is 1023040021211.
It is a de Polignac number, because none of the positive numbers 2k-1121200403201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121200403201.
It is not an unprimeable number, because it can be changed into a prime (1121200403261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78250700 + ... + 78265026.
It is an arithmetic number, because the mean of its divisors is an integer number (72737954640).
Almost surely, 21121200403201 is an apocalyptic number.
It is an amenable number.
1121200403201 is a deficient number, since it is larger than the sum of its proper divisors (42606871039).
1121200403201 is a wasteful number, since it uses less digits than its factorization.
1121200403201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23344.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1121200403201 its reverse (1023040021211), we get a palindrome (2144240424412).
The spelling of 1121200403201 in words is "one trillion, one hundred twenty-one billion, two hundred million, four hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •