Base | Representation |
---|---|
bin | 1001011111110000111111… |
… | …1101101111110010011111 |
3 | 1100222011220110202220210101 |
4 | 2113330033331233302133 |
5 | 2332032322313410333 |
6 | 34112403214121531 |
7 | 2125234655012542 |
oct | 227741775576237 |
9 | 40864813686711 |
10 | 10441333341343 |
11 | 3366165514553 |
12 | 12077254b02a7 |
13 | 5a97c8b58b98 |
14 | 2815129bc859 |
15 | 13190a3ec67d |
hex | 97f0ff6fc9f |
10441333341343 has 8 divisors (see below), whose sum is σ = 10895445881568. Its totient is φ = 9987232594944.
The previous prime is 10441333341337. The next prime is 10441333341401. The reversal of 10441333341343 is 34314333314401.
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-10441333341343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10441333348343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1115046 + ... + 4703827.
It is an arithmetic number, because the mean of its divisors is an integer number (1361930735196).
Almost surely, 210441333341343 is an apocalyptic number.
10441333341343 is a deficient number, since it is larger than the sum of its proper divisors (454112540225).
10441333341343 is an equidigital number, since it uses as much as digits as its factorization.
10441333341343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5896913.
The product of its (nonzero) digits is 186624, while the sum is 37.
Adding to 10441333341343 its reverse (34314333314401), we get a palindrome (44755666655744).
The spelling of 10441333341343 in words is "ten trillion, four hundred forty-one billion, three hundred thirty-three million, three hundred forty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •