Base | Representation |
---|---|
bin | 1010010111110000110010… |
… | …1001110011010000111001 |
3 | 1111101011001002200211000020 |
4 | 2211330030221303100321 |
5 | 2443313030204032403 |
6 | 40130343223401053 |
7 | 2254602440401623 |
oct | 245741451632071 |
9 | 44334032624006 |
10 | 11403350455353 |
11 | 36a7152057a7a |
12 | 1342066bb3189 |
13 | 64943cc2c14c |
14 | 2b5cd46c9c13 |
15 | 14b9622c0453 |
hex | a5f0ca73439 |
11403350455353 has 8 divisors (see below), whose sum is σ = 15204687710016. Its totient is φ = 7602123418800.
The previous prime is 11403350455313. The next prime is 11403350455361. The reversal of 11403350455353 is 35355405330411.
11403350455353 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 not a de Polignac number, because 11403350455353 - 212 = 11403350451257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11403350455313) 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, 27312813 + ... + 27727178.
It is an arithmetic number, because the mean of its divisors is an integer number (1900585963752).
Almost surely, 211403350455353 is an apocalyptic number.
It is an amenable number.
11403350455353 is a deficient number, since it is larger than the sum of its proper divisors (3801337254663).
11403350455353 is an equidigital number, since it uses as much as digits as its factorization.
11403350455353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55109055.
The product of its (nonzero) digits is 810000, while the sum is 42.
Adding to 11403350455353 its reverse (35355405330411), we get a palindrome (46758755785764).
The spelling of 11403350455353 in words is "eleven trillion, four hundred three billion, three hundred fifty million, four hundred fifty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •