Base | Representation |
---|---|
bin | 1001111011011010100… |
… | …00011111010000001001 |
3 | 1012121112022112200000102 |
4 | 10331231100133100021 |
5 | 21042121134031431 |
6 | 420414312415145 |
7 | 33434440345310 |
oct | 4755520372011 |
9 | 1177468480012 |
10 | 341135455241 |
11 | 1217470866a9 |
12 | 561456a74b5 |
13 | 262271c6b79 |
14 | 1272243b277 |
15 | 8d18bd1dcb |
hex | 4f6d41f409 |
341135455241 has 8 divisors (see below), whose sum is σ = 389875414464. Its totient is φ = 292397076720.
The previous prime is 341135455231. The next prime is 341135455249. The reversal of 341135455241 is 142554531143.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-341135455241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 341135455195 and 341135455204.
It is not an unprimeable number, because it can be changed into a prime (341135455249) 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, 110411 + ... + 833343.
It is an arithmetic number, because the mean of its divisors is an integer number (48734426808).
Almost surely, 2341135455241 is an apocalyptic number.
It is an amenable number.
341135455241 is a deficient number, since it is larger than the sum of its proper divisors (48739959223).
341135455241 is an equidigital number, since it uses as much as digits as its factorization.
341135455241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790351.
The product of its digits is 144000, while the sum is 38.
Adding to 341135455241 its reverse (142554531143), we get a palindrome (483689986384).
The spelling of 341135455241 in words is "three hundred forty-one billion, one hundred thirty-five million, four hundred fifty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •