Base | Representation |
---|---|
bin | 110100110000101010… |
… | …0110111100111010010 |
3 | 101211110012201110222200 |
4 | 1221201110313213102 |
5 | 3324020303312242 |
6 | 124014503144030 |
7 | 11120505124464 |
oct | 1514124674722 |
9 | 354405643880 |
10 | 113302010322 |
11 | 44062038366 |
12 | 19b60745016 |
13 | a8b8634277 |
14 | 56ab964134 |
15 | 2e31e4604c |
hex | 1a615379d2 |
113302010322 has 24 divisors (see below), whose sum is σ = 245543691276. Its totient is φ = 37758721056.
The previous prime is 113302010299. The next prime is 113302010407. The reversal of 113302010322 is 223010203311.
113302010322 is a `hidden beast` number, since 1 + 1 + 330 + 2 + 0 + 10 + 322 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 103451646321 + 9850364001 = 321639^2 + 99249^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 113302010295 and 113302010304.
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 11 ways as a sum of consecutive naturals, for example, 636633 + ... + 794924.
Almost surely, 2113302010322 is an apocalyptic number.
113302010322 is an abundant number, since it is smaller than the sum of its proper divisors (132241680954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113302010322 is a wasteful number, since it uses less digits than its factorization.
113302010322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1435962 (or 1435959 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 113302010322 its reverse (223010203311), we get a palindrome (336312213633).
The spelling of 113302010322 in words is "one hundred thirteen billion, three hundred two million, ten thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •