Base | Representation |
---|---|
bin | 11001110001001100111100… |
… | …000101111000001011010010 |
3 | 112212021110111120002222121002 |
4 | 121301030330011320023102 |
5 | 104323314032403311310 |
6 | 1041012051120302002 |
7 | 32604663204135065 |
oct | 3161147405701322 |
9 | 485243446088532 |
10 | 113332310213330 |
11 | 33124a6560370a |
12 | 10864689471902 |
13 | 4b31263804b90 |
14 | 1ddb4551508dc |
15 | d18077e7bda5 |
hex | 67133c1782d2 |
113332310213330 has 64 divisors (see below), whose sum is σ = 227577262197600. Its totient is φ = 40366437703680.
The previous prime is 113332310213321. The next prime is 113332310213347. The reversal of 113332310213330 is 33312013233311.
It can be written as a sum of positive squares in 16 ways, for example, as 39412191635569 + 73920118577761 = 6277913^2 + 8597681^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 113332310213293 and 113332310213302.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118981235 + ... + 119929974.
Almost surely, 2113332310213330 is an apocalyptic number.
113332310213330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113332310213330 is an abundant number, since it is smaller than the sum of its proper divisors (114244951984270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113332310213330 is a wasteful number, since it uses less digits than its factorization.
113332310213330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238911359.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 113332310213330 its reverse (33312013233311), we get a palindrome (146644323446641).
The spelling of 113332310213330 in words is "one hundred thirteen trillion, three hundred thirty-two billion, three hundred ten million, two hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •