Base | Representation |
---|---|
bin | 10101010000011… |
… | …001001100100010 |
3 | 220212001010100200 |
4 | 111100121030202 |
5 | 1212243302132 |
6 | 55215330030 |
7 | 11560132443 |
oct | 2520311442 |
9 | 825033320 |
10 | 356619042 |
11 | 17333618a |
12 | 9b520916 |
13 | 58b62bb0 |
14 | 355112ca |
15 | 21494d7c |
hex | 15419322 |
356619042 has 24 divisors (see below), whose sum is σ = 832111644. Its totient is φ = 109728864.
The previous prime is 356619041. The next prime is 356619049. The reversal of 356619042 is 240916653.
It is a happy number.
356619042 is a `hidden beast` number, since 3 + 566 + 1 + 90 + 4 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 355737321 + 881721 = 18861^2 + 939^2 .
It is a super-2 number, since 2×3566190422 = 254354282233995528, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 356618988 and 356619006.
It is not an unprimeable number, because it can be changed into a prime (356619041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 761773 + ... + 762240.
Almost surely, 2356619042 is an apocalyptic number.
356619042 is an abundant number, since it is smaller than the sum of its proper divisors (475492602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
356619042 is a wasteful number, since it uses less digits than its factorization.
356619042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524034 (or 1524031 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The square root of 356619042 is about 18884.3597190903. The cubic root of 356619042 is about 709.1446699333.
The spelling of 356619042 in words is "three hundred fifty-six million, six hundred nineteen thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •