Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …010001111000101111000 |
3 | 11022122021220102220022111 |
4 | 101300103222033011320 |
5 | 124442231220113112 |
6 | 2332301221102104 |
7 | 154102141365436 |
oct | 21602352170570 |
9 | 4278256386274 |
10 | 1220100551032 |
11 | 430494a53640 |
12 | 178569257934 |
13 | 8b093a69b9c |
14 | 430a5d05d56 |
15 | 21b0e6b95a7 |
hex | 11c13a8f178 |
1220100551032 has 32 divisors (see below), whose sum is σ = 2495857150080. Its totient is φ = 554547396960.
The previous prime is 1220100551027. The next prime is 1220100551041. The reversal of 1220100551032 is 2301550010221.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1220100550994 and 1220100551012.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 587803 + ... + 1669045.
It is an arithmetic number, because the mean of its divisors is an integer number (77995535940).
Almost surely, 21220100551032 is an apocalyptic number.
It is an amenable number.
1220100551032 is an abundant number, since it is smaller than the sum of its proper divisors (1275756599048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220100551032 is a wasteful number, since it uses less digits than its factorization.
1220100551032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094083 (or 1094079 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 1220100551032 its reverse (2301550010221), we get a palindrome (3521650561253).
The spelling of 1220100551032 in words is "one trillion, two hundred twenty billion, one hundred million, five hundred fifty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •