Base | Representation |
---|---|
bin | 10100100011011010010… |
… | …000111000010011101011 |
3 | 12000000200100201120200122 |
4 | 110203122100320103223 |
5 | 141120104222143430 |
6 | 3000504104153455 |
7 | 204020602345535 |
oct | 24433220702353 |
9 | 5000610646618 |
10 | 1412411131115 |
11 | 4a5000297846 |
12 | 1a989976888b |
13 | a3260ca963a |
14 | 4c50aa88855 |
15 | 26b17a41ee5 |
hex | 148da4384eb |
1412411131115 has 8 divisors (see below), whose sum is σ = 1704257410128. Its totient is φ = 1123686203040.
The previous prime is 1412411131111. The next prime is 1412411131123. The reversal of 1412411131115 is 5111311142141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1412411131115 - 22 = 1412411131111 is a prime.
It is a super-2 number, since 2×14124111311152 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1412411131111) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 780336737 + ... + 780338546.
It is an arithmetic number, because the mean of its divisors is an integer number (213032176266).
Almost surely, 21412411131115 is an apocalyptic number.
1412411131115 is a deficient number, since it is larger than the sum of its proper divisors (291846279013).
1412411131115 is a wasteful number, since it uses less digits than its factorization.
1412411131115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1560675469.
The product of its digits is 480, while the sum is 26.
Adding to 1412411131115 its reverse (5111311142141), we get a palindrome (6523722273256).
The spelling of 1412411131115 in words is "one trillion, four hundred twelve billion, four hundred eleven million, one hundred thirty-one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •