Base | Representation |
---|---|
bin | 1010000010101111111011… |
… | …0100001001000110010111 |
3 | 1110002122012201202222110111 |
4 | 2200223332310021012113 |
5 | 2421404203301013333 |
6 | 35252440442503451 |
7 | 2216532335053315 |
oct | 240537664110627 |
9 | 43078181688414 |
10 | 11042341032343 |
11 | 3578037704225 |
12 | 12a40b5804b87 |
13 | 6213994b714a |
14 | 2a2648a130b5 |
15 | 14238396a4cd |
hex | a0afed09197 |
11042341032343 has 8 divisors (see below), whose sum is σ = 11198077838496. Its totient is φ = 10886610084000.
The previous prime is 11042341032341. The next prime is 11042341032403. The reversal of 11042341032343 is 34323014324011.
11042341032343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11042341032343 - 21 = 11042341032341 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11042341032341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2403805 + ... + 5278537.
It is an arithmetic number, because the mean of its divisors is an integer number (1399759729812).
Almost surely, 211042341032343 is an apocalyptic number.
11042341032343 is a deficient number, since it is larger than the sum of its proper divisors (155736806153).
11042341032343 is an equidigital number, since it uses as much as digits as its factorization.
11042341032343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2928905.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 11042341032343 its reverse (34323014324011), we get a palindrome (45365355356354).
The spelling of 11042341032343 in words is "eleven trillion, forty-two billion, three hundred forty-one million, thirty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •