Base | Representation |
---|---|
bin | 1010100100011111010101… |
… | …1000110111101100010100 |
3 | 1112011001102101220222120110 |
4 | 2221013311120313230110 |
5 | 3010403330342120142 |
6 | 40415024044403020 |
7 | 2306443036364031 |
oct | 251076530675424 |
9 | 45131371828513 |
10 | 11622003473172 |
11 | 3780955a80584 |
12 | 1378509546470 |
13 | 663c4784b371 |
14 | 2c2717c22388 |
15 | 1524ad0de99c |
hex | a91f5637b14 |
11622003473172 has 24 divisors (see below), whose sum is σ = 27169858994656. Its totient is φ = 3866593887648.
The previous prime is 11622003473141. The next prime is 11622003473243. The reversal of 11622003473172 is 27137430022611.
It is a self number, because there is not a number n which added to its sum of digits gives 11622003473172.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 925902223 + ... + 925914774.
Almost surely, 211622003473172 is an apocalyptic number.
11622003473172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11622003473172 is an abundant number, since it is smaller than the sum of its proper divisors (15547855521484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11622003473172 is a wasteful number, since it uses less digits than its factorization.
11622003473172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851817527 (or 1851817525 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 39.
Adding to 11622003473172 its reverse (27137430022611), we get a palindrome (38759433495783).
The spelling of 11622003473172 in words is "eleven trillion, six hundred twenty-two billion, three million, four hundred seventy-three thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •