Base | Representation |
---|---|
bin | 10100101011100010101… |
… | …111001000100000010111 |
3 | 12000212012220200100122200 |
4 | 110223202233020200113 |
5 | 141241000130322403 |
6 | 3004510355055543 |
7 | 204450153002454 |
oct | 24534257104027 |
9 | 5025186610580 |
10 | 1421143214103 |
11 | 4a8781327a58 |
12 | 1ab515ba15b3 |
13 | a40230b2c52 |
14 | 4cad867c82b |
15 | 26e7944aca3 |
hex | 14ae2bc8817 |
1421143214103 has 24 divisors (see below), whose sum is σ = 2055055699008. Its totient is φ = 946370941632.
The previous prime is 1421143214083. The next prime is 1421143214119. The reversal of 1421143214103 is 3014123411241.
It is a happy number.
1421143214103 is a `hidden beast` number, since 1 + 4 + 211 + 4 + 32 + 1 + 410 + 3 = 666.
It is not a de Polignac number, because 1421143214103 - 216 = 1421143148567 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421143214123) 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 23 ways as a sum of consecutive naturals, for example, 32725801 + ... + 32769197.
It is an arithmetic number, because the mean of its divisors is an integer number (85627320792).
Almost surely, 21421143214103 is an apocalyptic number.
1421143214103 is a deficient number, since it is larger than the sum of its proper divisors (633912484905).
1421143214103 is a wasteful number, since it uses less digits than its factorization.
1421143214103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47383 (or 47380 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 1421143214103 its reverse (3014123411241), we get a palindrome (4435266625344).
The spelling of 1421143214103 in words is "one trillion, four hundred twenty-one billion, one hundred forty-three million, two hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •