Base | Representation |
---|---|
bin | 1010011101100101101100… |
… | …0100110101000011000001 |
3 | 1111201201102020102102220101 |
4 | 2213121123010311003001 |
5 | 3001433031301124301 |
6 | 40244340121042401 |
7 | 2265045140106610 |
oct | 247313304650301 |
9 | 44651366372811 |
10 | 11503450411201 |
11 | 3735649954411 |
12 | 1359542326401 |
13 | 655a03368258 |
14 | 2baaacb29877 |
15 | 14e3701a1701 |
hex | a765b1350c1 |
11503450411201 has 8 divisors (see below), whose sum is σ = 13147160682240. Its totient is φ = 9859830193248.
The previous prime is 11503450411199. The next prime is 11503450411207. The reversal of 11503450411201 is 10211405430511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11503450411201 - 21 = 11503450411199 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11503450411201.
It is not an unprimeable number, because it can be changed into a prime (11503450411207) 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, 22239316 + ... + 22750693.
It is an arithmetic number, because the mean of its divisors is an integer number (1643395085280).
Almost surely, 211503450411201 is an apocalyptic number.
It is an amenable number.
11503450411201 is a deficient number, since it is larger than the sum of its proper divisors (1643710271039).
11503450411201 is an equidigital number, since it uses as much as digits as its factorization.
11503450411201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45026543.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 11503450411201 its reverse (10211405430511), we get a palindrome (21714855841712).
The spelling of 11503450411201 in words is "eleven trillion, five hundred three billion, four hundred fifty million, four hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •