Base | Representation |
---|---|
bin | 10001110000100110000… |
… | …111111010010100000100 |
3 | 11022200002111022210122010 |
4 | 101300212013322110010 |
5 | 124443400020221012 |
6 | 2332352044334220 |
7 | 154112622363363 |
oct | 21604607722404 |
9 | 4280074283563 |
10 | 1220410320132 |
11 | 43063389a763 |
12 | 178634b44370 |
13 | 8b112ca8403 |
14 | 430d50dd7da |
15 | 21b2b9a7c3c |
hex | 11c261fa504 |
1220410320132 has 24 divisors (see below), whose sum is σ = 2860059126400. Its totient is φ = 405027004896.
The previous prime is 1220410320119. The next prime is 1220410320193. The reversal of 1220410320132 is 2310230140221.
It is a super-3 number, since 3×12204103201323 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220410320099 and 1220410320108.
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 7 ways as a sum of consecutive naturals, for example, 222051532 + ... + 222057027.
Almost surely, 21220410320132 is an apocalyptic number.
1220410320132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1220410320132 is an abundant number, since it is smaller than the sum of its proper divisors (1639648806268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220410320132 is a wasteful number, since it uses less digits than its factorization.
1220410320132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444108795 (or 444108793 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1220410320132 its reverse (2310230140221), we get a palindrome (3530640460353).
The spelling of 1220410320132 in words is "one trillion, two hundred twenty billion, four hundred ten million, three hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •