Base | Representation |
---|---|
bin | 10001110000001110011… |
… | …001101000101000101100 |
3 | 11022122001202101221200010 |
4 | 101300032121220220230 |
5 | 124442041123010012 |
6 | 2332244345533220 |
7 | 154100020362204 |
oct | 21601631505054 |
9 | 4278052357603 |
10 | 1220012313132 |
11 | 43044a166158 |
12 | 1785437a4210 |
13 | 8b07b6b4002 |
14 | 430982d7404 |
15 | 21b06a89c3c |
hex | 11c0e668a2c |
1220012313132 has 48 divisors (see below), whose sum is σ = 2954449935360. Its totient is φ = 391368624192.
The previous prime is 1220012313109. The next prime is 1220012313217. The reversal of 1220012313132 is 2313132100221.
It is a junction number, because it is equal to n+sod(n) for n = 1220012313099 and 1220012313108.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5602908 + ... + 5816579.
It is an arithmetic number, because the mean of its divisors is an integer number (61551040320).
Almost surely, 21220012313132 is an apocalyptic number.
1220012313132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1220012313132 is an abundant number, since it is smaller than the sum of its proper divisors (1734437622228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220012313132 is a wasteful number, since it uses less digits than its factorization.
1220012313132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11419830 (or 11419828 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1220012313132 its reverse (2313132100221), we get a palindrome (3533144413353).
The spelling of 1220012313132 in words is "one trillion, two hundred twenty billion, twelve million, three hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •