Base | Representation |
---|---|
bin | 1010010111010100000… |
… | …01101101101100101101 |
3 | 1021001012011122002112011 |
4 | 11023222001231230231 |
5 | 21313310042324031 |
6 | 431332451041221 |
7 | 34504553651224 |
oct | 5135201555455 |
9 | 1231164562464 |
10 | 356113636141 |
11 | 1280329556aa |
12 | 590258a0211 |
13 | 277733737c3 |
14 | 133437c1cbb |
15 | 93e3b366b1 |
hex | 52ea06db2d |
356113636141 has 4 divisors (see below), whose sum is σ = 356164640352. Its totient is φ = 356062631932.
The previous prime is 356113636139. The next prime is 356113636169. The reversal of 356113636141 is 141636311653.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 356113636141 - 21 = 356113636139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 356113636094 and 356113636103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (356113636841) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25491631 + ... + 25505596.
It is an arithmetic number, because the mean of its divisors is an integer number (89041160088).
Almost surely, 2356113636141 is an apocalyptic number.
It is an amenable number.
356113636141 is a deficient number, since it is larger than the sum of its proper divisors (51004211).
356113636141 is an equidigital number, since it uses as much as digits as its factorization.
356113636141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51004210.
The product of its digits is 116640, while the sum is 40.
Adding to 356113636141 its reverse (141636311653), we get a palindrome (497749947794).
The spelling of 356113636141 in words is "three hundred fifty-six billion, one hundred thirteen million, six hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •