Base | Representation |
---|---|
bin | 10001110000100000111… |
… | …011001111010010011100 |
3 | 11022122212102020011200201 |
4 | 101300200323033102130 |
5 | 124443210204041332 |
6 | 2332335251233244 |
7 | 154110513206500 |
oct | 21604073172234 |
9 | 4278772204621 |
10 | 1220323112092 |
11 | 430599645aa7 |
12 | 17860b8a8824 |
13 | 8b0cabc3216 |
14 | 430c76bc300 |
15 | 21b23ecd5e7 |
hex | 11c20ecf49c |
1220323112092 has 36 divisors (see below), whose sum is σ = 2630360328624. Its totient is φ = 492231169920.
The previous prime is 1220323112083. The next prime is 1220323112093. The reversal of 1220323112092 is 2902113230221.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 1220323112092.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220323112093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 183118384 + ... + 183125047.
It is an arithmetic number, because the mean of its divisors is an integer number (73065564684).
Almost surely, 21220323112092 is an apocalyptic number.
It is an amenable number.
1220323112092 is an abundant number, since it is smaller than the sum of its proper divisors (1410037216532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220323112092 is a wasteful number, since it uses less digits than its factorization.
1220323112092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366243466 (or 366243457 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 1220323112092 in words is "one trillion, two hundred twenty billion, three hundred twenty-three million, one hundred twelve thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •