Base | Representation |
---|---|
bin | 10000010011010010100… |
… | …000011000001100100001 |
3 | 10222002111021120202212101 |
4 | 100103102200120030201 |
5 | 121323204114400113 |
6 | 2214342354530401 |
7 | 143635114043260 |
oct | 20232240301441 |
9 | 3862437522771 |
10 | 1120223200033 |
11 | 3a20a1879553 |
12 | 161134596a01 |
13 | 818377a1022 |
14 | 3c30d2905d7 |
15 | 1e21610a2dd |
hex | 104d2818321 |
1120223200033 has 4 divisors (see below), whose sum is σ = 1280255085760. Its totient is φ = 960191314308.
The previous prime is 1120223200021. The next prime is 1120223200127. The reversal of 1120223200033 is 3300023220211.
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 1120223200033 - 29 = 1120223199521 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1120223200133) 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 3 ways as a sum of consecutive naturals, for example, 80015942853 + ... + 80015942866.
It is an arithmetic number, because the mean of its divisors is an integer number (320063771440).
Almost surely, 21120223200033 is an apocalyptic number.
It is an amenable number.
1120223200033 is a deficient number, since it is larger than the sum of its proper divisors (160031885727).
1120223200033 is an equidigital number, since it uses as much as digits as its factorization.
1120223200033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160031885726.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1120223200033 its reverse (3300023220211), we get a palindrome (4420246420244).
The spelling of 1120223200033 in words is "one trillion, one hundred twenty billion, two hundred twenty-three million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •