Base | Representation |
---|---|
bin | 11001101100101011011001… |
… | …101001110011111011101000 |
3 | 112211011202001011021210221011 |
4 | 121230223121221303323220 |
5 | 104303220332241342212 |
6 | 1040213153554353304 |
7 | 32543346113606416 |
oct | 3154533151637350 |
9 | 484152034253834 |
10 | 113021421043432 |
11 | 3301512a797950 |
12 | 1081438528b834 |
13 | 4b0ab49a14a95 |
14 | 1dca3a1b4c2b6 |
15 | d0ee2e8224a7 |
hex | 66cad9a73ee8 |
113021421043432 has 64 divisors (see below), whose sum is σ = 239164355160000. Its totient is φ = 49599296302080.
The previous prime is 113021421043423. The next prime is 113021421043499. The reversal of 113021421043432 is 234340124120311.
It is a happy number.
It is a super-2 number, since 2×1130214210434322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113021421043394 and 113021421043403.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48312544 + ... + 50597872.
It is an arithmetic number, because the mean of its divisors is an integer number (3736943049375).
Almost surely, 2113021421043432 is an apocalyptic number.
It is an amenable number.
113021421043432 is an abundant number, since it is smaller than the sum of its proper divisors (126142934116568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113021421043432 is a wasteful number, since it uses less digits than its factorization.
113021421043432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304754 (or 2304750 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 113021421043432 its reverse (234340124120311), we get a palindrome (347361545163743).
The spelling of 113021421043432 in words is "one hundred thirteen trillion, twenty-one billion, four hundred twenty-one million, forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •