Base | Representation |
---|---|
bin | 1010010111101101010010… |
… | …1010100010000110011111 |
3 | 1111101001121122011210101220 |
4 | 2211323110222202012133 |
5 | 2443304114221414403 |
6 | 40130110110304423 |
7 | 2254540243245630 |
oct | 245732452420637 |
9 | 44331548153356 |
10 | 11402411123103 |
11 | 36a680a900830 |
12 | 1341a444b8113 |
13 | 649320443b50 |
14 | 2b5c45a51887 |
15 | 14b909ac4953 |
hex | a5ed4aa219f |
11402411123103 has 64 divisors (see below), whose sum is σ = 20425324953600. Its totient is φ = 5464310117760.
The previous prime is 11402411123069. The next prime is 11402411123111. The reversal of 11402411123103 is 30132111420411.
It is not a de Polignac number, because 11402411123103 - 214 = 11402411106719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11402411123113) 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 63 ways as a sum of consecutive naturals, for example, 3689218 + ... + 6034496.
It is an arithmetic number, because the mean of its divisors is an integer number (319145702400).
Almost surely, 211402411123103 is an apocalyptic number.
11402411123103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11402411123103 is a deficient number, since it is larger than the sum of its proper divisors (9022913830497).
11402411123103 is a wasteful number, since it uses less digits than its factorization.
11402411123103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2346932.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11402411123103 its reverse (30132111420411), we get a palindrome (41534522543514).
The spelling of 11402411123103 in words is "eleven trillion, four hundred two billion, four hundred eleven million, one hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •