Base | Representation |
---|---|
bin | 10100100010100101001… |
… | …101101100100111100010 |
3 | 11222221101022222112111112 |
4 | 110202211031230213202 |
5 | 141111243400314404 |
6 | 3000235511543322 |
7 | 203656544265404 |
oct | 24424515544742 |
9 | 4887338875445 |
10 | 1411521104354 |
11 | 4a4693957539 |
12 | 1a968b68ab42 |
13 | a314b79559a |
14 | 4c4647a6b74 |
15 | 26ab483556e |
hex | 148a536c9e2 |
1411521104354 has 32 divisors (see below), whose sum is σ = 2235549580416. Its totient is φ = 667097516800.
The previous prime is 1411521104291. The next prime is 1411521104401. The reversal of 1411521104354 is 4534011251141.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1411521104354.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1616144 + ... + 2331300.
It is an arithmetic number, because the mean of its divisors is an integer number (69860924388).
Almost surely, 21411521104354 is an apocalyptic number.
1411521104354 is a deficient number, since it is larger than the sum of its proper divisors (824028476062).
1411521104354 is a wasteful number, since it uses less digits than its factorization.
1411521104354 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715690.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 1411521104354 its reverse (4534011251141), we get a palindrome (5945532355495).
The spelling of 1411521104354 in words is "one trillion, four hundred eleven billion, five hundred twenty-one million, one hundred four thousand, three hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •