Base | Representation |
---|---|
bin | 10100100101000000010… |
… | …011111011001000001101 |
3 | 12000012002200021221201110 |
4 | 110211000103323020031 |
5 | 141132111020031013 |
6 | 3001350024002233 |
7 | 204111201626142 |
oct | 24450023731015 |
9 | 5005080257643 |
10 | 1414123205133 |
11 | 4a57a9757351 |
12 | 1aa097000379 |
13 | a34748c27a2 |
14 | 4c6301d43c9 |
15 | 26bb7ecd2c3 |
hex | 149404fb20d |
1414123205133 has 16 divisors (see below), whose sum is σ = 1996507253376. Its totient is φ = 887249425920.
The previous prime is 1414123205119. The next prime is 1414123205179. The reversal of 1414123205133 is 3315023214141.
It is not a de Polignac number, because 1414123205133 - 26 = 1414123205069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1414123205133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414123205333) by changing a digit.
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, 384360 + ... + 1725102.
It is an arithmetic number, because the mean of its divisors is an integer number (124781703336).
Almost surely, 21414123205133 is an apocalyptic number.
It is an amenable number.
1414123205133 is a deficient number, since it is larger than the sum of its proper divisors (582384048243).
1414123205133 is a wasteful number, since it uses less digits than its factorization.
1414123205133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1361444.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 1414123205133 its reverse (3315023214141), we get a palindrome (4729146419274).
The spelling of 1414123205133 in words is "one trillion, four hundred fourteen billion, one hundred twenty-three million, two hundred five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •