Base | Representation |
---|---|
bin | 11001110001000010100101… |
… | …111000100101000100100100 |
3 | 112212020101211021200100110010 |
4 | 121301002211320211010210 |
5 | 104323123304223211322 |
6 | 1041003012442330220 |
7 | 32604120660515331 |
oct | 3161024570450444 |
9 | 485211737610403 |
10 | 113321200210212 |
11 | 33120284271955 |
12 | 108624a87b9970 |
13 | 4b301b2b73937 |
14 | 1ddaabd807988 |
15 | d17b2790e20c |
hex | 6710a5e25124 |
113321200210212 has 48 divisors (see below), whose sum is σ = 265752119808000. Its totient is φ = 37582888638240.
The previous prime is 113321200210091. The next prime is 113321200210241. The reversal of 113321200210212 is 212012002123311.
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 15 ways as a sum of consecutive naturals, for example, 89376589 + ... + 90635627.
It is an arithmetic number, because the mean of its divisors is an integer number (5536502496000).
Almost surely, 2113321200210212 is an apocalyptic number.
113321200210212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113321200210212 is an abundant number, since it is smaller than the sum of its proper divisors (152430919597788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113321200210212 is a wasteful number, since it uses less digits than its factorization.
113321200210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296936 (or 1296934 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 113321200210212 its reverse (212012002123311), we get a palindrome (325333202333523).
The spelling of 113321200210212 in words is "one hundred thirteen trillion, three hundred twenty-one billion, two hundred million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •