Base | Representation |
---|---|
bin | 1001111011010111100… |
… | …11101100100101001011 |
3 | 1012121110121202211122222 |
4 | 10331223303230211023 |
5 | 21042043422133233 |
6 | 420412043204255 |
7 | 33434023524446 |
oct | 4755363544513 |
9 | 1177417684588 |
10 | 341111130443 |
11 | 121734382066 |
12 | 5613951668b |
13 | 2622215b0b5 |
14 | 1271d10865d |
15 | 8d169c9898 |
hex | 4f6bcec94b |
341111130443 has 8 divisors (see below), whose sum is σ = 352513514496. Its totient is φ = 329733671400.
The previous prime is 341111130439. The next prime is 341111130463. The reversal of 341111130443 is 344031111143.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 341111130443 - 22 = 341111130439 is a prime.
It is a super-2 number, since 2×3411111304432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (341111130413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6203423 + ... + 6258168.
It is an arithmetic number, because the mean of its divisors is an integer number (44064189312).
Almost surely, 2341111130443 is an apocalyptic number.
341111130443 is a deficient number, since it is larger than the sum of its proper divisors (11402384053).
341111130443 is a wasteful number, since it uses less digits than its factorization.
341111130443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12462505.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 341111130443 its reverse (344031111143), we get a palindrome (685142241586).
The spelling of 341111130443 in words is "three hundred forty-one billion, one hundred eleven million, one hundred thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •