Base | Representation |
---|---|
bin | 10100100010100000100… |
… | …100101011110011000110 |
3 | 11222221011220110211111020 |
4 | 110202200210223303012 |
5 | 141111113432303410 |
6 | 3000224051052010 |
7 | 203654610424065 |
oct | 24424044536306 |
9 | 4887156424436 |
10 | 1411443244230 |
11 | 4a4653a08028 |
12 | 1a96695a1006 |
13 | a31386041c6 |
14 | 4c4582da1dc |
15 | 26aacaa5a70 |
hex | 148a092bcc6 |
1411443244230 has 32 divisors (see below), whose sum is σ = 3586726363104. Its totient is φ = 354244578816.
The previous prime is 1411443244217. The next prime is 1411443244249. The reversal of 1411443244230 is 324423441141.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1411443244191 and 1411443244200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1383767377 + ... + 1383768396.
It is an arithmetic number, because the mean of its divisors is an integer number (112085198847).
Almost surely, 21411443244230 is an apocalyptic number.
1411443244230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1411443244230 is an abundant number, since it is smaller than the sum of its proper divisors (2175283118874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1411443244230 is a wasteful number, since it uses less digits than its factorization.
1411443244230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2767535800.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 1411443244230 its reverse (324423441141), we get a palindrome (1735866685371).
The spelling of 1411443244230 in words is "one trillion, four hundred eleven billion, four hundred forty-three million, two hundred forty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •