Base | Representation |
---|---|
bin | 10000010100111101000… |
… | …001101000101101100010 |
3 | 10222021002211100000201101 |
4 | 100110331001220231202 |
5 | 121340334114201310 |
6 | 2215235554425014 |
7 | 144030314135050 |
oct | 20247501505542 |
9 | 3867084300641 |
10 | 1122010303330 |
11 | 3a2929624724 |
12 | 161552b9216a |
13 | 81a60ac6bb7 |
14 | 3c43c76b1d0 |
15 | 1e2bce6743a |
hex | 1053d068b62 |
1122010303330 has 64 divisors (see below), whose sum is σ = 2349374987520. Its totient is φ = 377834284800.
The previous prime is 1122010303327. The next prime is 1122010303331. The reversal of 1122010303330 is 333030102211.
It is a junction number, because it is equal to n+sod(n) for n = 1122010303298 and 1122010303307.
It is not an unprimeable number, because it can be changed into a prime (1122010303331) 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 31 ways as a sum of consecutive naturals, for example, 2760436 + ... + 3140704.
It is an arithmetic number, because the mean of its divisors is an integer number (36708984180).
Almost surely, 21122010303330 is an apocalyptic number.
1122010303330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1122010303330 is an abundant number, since it is smaller than the sum of its proper divisors (1227364684190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122010303330 is a wasteful number, since it uses less digits than its factorization.
1122010303330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381035.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1122010303330 its reverse (333030102211), we get a palindrome (1455040405541).
The spelling of 1122010303330 in words is "one trillion, one hundred twenty-two billion, ten million, three hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •