Base | Representation |
---|---|
bin | 10100101010101011011… |
… | …011001000101100110101 |
3 | 12000202211020111122010010 |
4 | 110222223123020230311 |
5 | 141232100044201031 |
6 | 3004234325050433 |
7 | 204415154142336 |
oct | 24525333105465 |
9 | 5022736448103 |
10 | 1420215225141 |
11 | 4a8345519129 |
12 | 1ab2b7256a19 |
13 | a3c05a69a5b |
14 | 4ca4b31828d |
15 | 26e22c41246 |
hex | 14aab6c8b35 |
1420215225141 has 8 divisors (see below), whose sum is σ = 1895047298944. Its totient is φ = 946096650720.
The previous prime is 1420215225133. The next prime is 1420215225181. The reversal of 1420215225141 is 1415225120241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1420215225141 - 23 = 1420215225133 is a prime.
It is a super-2 number, since 2×14202152251412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1420215225099 and 1420215225108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1420215225131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178370200 + ... + 178378161.
It is an arithmetic number, because the mean of its divisors is an integer number (236880912368).
Almost surely, 21420215225141 is an apocalyptic number.
It is an amenable number.
1420215225141 is a deficient number, since it is larger than the sum of its proper divisors (474832073803).
1420215225141 is a wasteful number, since it uses less digits than its factorization.
1420215225141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356749691.
The product of its (nonzero) digits is 6400, while the sum is 30.
The spelling of 1420215225141 in words is "one trillion, four hundred twenty billion, two hundred fifteen million, two hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •