Base | Representation |
---|---|
bin | 10101001110101… |
… | …000001011010001 |
3 | 220211011121100011 |
4 | 111032220023101 |
5 | 1212133443423 |
6 | 55201354521 |
7 | 11553164005 |
oct | 2516501321 |
9 | 824147304 |
10 | 356156113 |
11 | 17304a3a5 |
12 | 9b338a41 |
13 | 58a30281 |
14 | 35430705 |
15 | 21402b0d |
hex | 153a82d1 |
356156113 has 4 divisors (see below), whose sum is σ = 356530788. Its totient is φ = 355781440.
The previous prime is 356156089. The next prime is 356156147. The reversal of 356156113 is 311651653.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311651653 = 5783 ⋅53891.
It can be written as a sum of positive squares in 2 ways, for example, as 283855104 + 72301009 = 16848^2 + 8503^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-356156113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (356156183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185908 + ... + 187813.
It is an arithmetic number, because the mean of its divisors is an integer number (89132697).
Almost surely, 2356156113 is an apocalyptic number.
It is an amenable number.
356156113 is a deficient number, since it is larger than the sum of its proper divisors (374675).
356156113 is an equidigital number, since it uses as much as digits as its factorization.
356156113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374674.
The product of its digits is 8100, while the sum is 31.
The square root of 356156113 is about 18872.0987969012. The cubic root of 356156113 is about 708.8376889576.
The spelling of 356156113 in words is "three hundred fifty-six million, one hundred fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •