Base | Representation |
---|---|
bin | 1010011010011110111100… |
… | …1001111110010101101111 |
3 | 1111112121201011121120110111 |
4 | 2212213233021332111233 |
5 | 3000044301123304403 |
6 | 40204034201120451 |
7 | 2261146104650506 |
oct | 246475711762557 |
9 | 44477634546414 |
10 | 11450100213103 |
11 | 3714a62080a02 |
12 | 134b133489127 |
13 | 6509804bb8b6 |
14 | 2b828b4b383d |
15 | 14cc9b64056d |
hex | a69ef27e56f |
11450100213103 has 8 divisors (see below), whose sum is σ = 11532555417600. Its totient is φ = 11367646157208.
The previous prime is 11450100213047. The next prime is 11450100213107. The reversal of 11450100213103 is 30131200105411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11450100213103 is a prime.
It is a super-2 number, since 2×114501002131032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11450100213107) 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, 38870988 + ... + 39164446.
It is an arithmetic number, because the mean of its divisors is an integer number (1441569427200).
Almost surely, 211450100213103 is an apocalyptic number.
11450100213103 is a deficient number, since it is larger than the sum of its proper divisors (82455204497).
11450100213103 is a wasteful number, since it uses less digits than its factorization.
11450100213103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 574301.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 11450100213103 its reverse (30131200105411), we get a palindrome (41581300318514).
The spelling of 11450100213103 in words is "eleven trillion, four hundred fifty billion, one hundred million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •