Base | Representation |
---|---|
bin | 11001110001000011101001… |
… | …010010111110001100011010 |
3 | 112212020111202002211200222002 |
4 | 121301003221102332030122 |
5 | 104323133113241433310 |
6 | 1041003321003401002 |
7 | 32604161003011415 |
oct | 3161035122761432 |
9 | 485214662750862 |
10 | 113322331202330 |
11 | 33120804724a88 |
12 | 10862763523162 |
13 | 4b30333286043 |
14 | 1ddab89ad2b7c |
15 | d17b91d67da5 |
hex | 6710e94be31a |
113322331202330 has 16 divisors (see below), whose sum is σ = 215979031233000. Its totient is φ = 42662524687872.
The previous prime is 113322331202317. The next prime is 113322331202351. The reversal of 113322331202330 is 33202133223311.
It can be written as a sum of positive squares in 4 ways, for example, as 81286470841801 + 32035860360529 = 9015901^2 + 5660023^2 .
It is a junction number, because it is equal to n+sod(n) for n = 113322331202293 and 113322331202302.
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, 333300973955 + ... + 333300974294.
Almost surely, 2113322331202330 is an apocalyptic number.
113322331202330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113322331202330 is a deficient number, since it is larger than the sum of its proper divisors (102656700030670).
113322331202330 is a wasteful number, since it uses less digits than its factorization.
113322331202330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666601948273.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 113322331202330 its reverse (33202133223311), we get a palindrome (146524464425641).
The spelling of 113322331202330 in words is "one hundred thirteen trillion, three hundred twenty-two billion, three hundred thirty-one million, two hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •