Base | Representation |
---|---|
bin | 1010010001101101000… |
… | …11110111011101000000 |
3 | 1020202102100000012001120 |
4 | 11020312203313131000 |
5 | 21241123242040422 |
6 | 430114012032240 |
7 | 34340133226014 |
oct | 5106643673500 |
9 | 1222370005046 |
10 | 353102690112 |
11 | 126828299357 |
12 | 58525462680 |
13 | 273b3628c33 |
14 | 1313996a544 |
15 | 92b962e45c |
hex | 52368f7740 |
353102690112 has 56 divisors (see below), whose sum is σ = 934343685792. Its totient is φ = 117689203200.
The previous prime is 353102690111. The next prime is 353102690123. The reversal of 353102690112 is 211096201353.
It is a super-2 number, since 2×3531026901122 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (353102690111) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1966662 + ... + 2138682.
Almost surely, 2353102690112 is an apocalyptic number.
353102690112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
353102690112 is an abundant number, since it is smaller than the sum of its proper divisors (581240995680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
353102690112 is a wasteful number, since it uses less digits than its factorization.
353102690112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182727 (or 182717 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 33.
Adding to 353102690112 its reverse (211096201353), we get a palindrome (564198891465).
The spelling of 353102690112 in words is "three hundred fifty-three billion, one hundred two million, six hundred ninety thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •