Base | Representation |
---|---|
bin | 100000010111101100001101… |
… | …101110100001110001000101 |
3 | 200200002000021021000022012202 |
4 | 200113230031232201301011 |
5 | 122130004031340330003 |
6 | 1222441451334524245 |
7 | 41662366041200330 |
oct | 4027541556416105 |
9 | 620060237008182 |
10 | 142365511261253 |
11 | 413a8968711555 |
12 | 13b73481806685 |
13 | 6159019288187 |
14 | 27227556bb617 |
15 | 116d3c1172088 |
hex | 817b0dba1c45 |
142365511261253 has 8 divisors (see below), whose sum is σ = 162927242604672. Its totient is φ = 121859730208656.
The previous prime is 142365511261231. The next prime is 142365511261273. The reversal of 142365511261253 is 352162115563241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142365511261253 - 212 = 142365511257157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142365511261198 and 142365511261207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142365511261223) 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, 13987567250 + ... + 13987577427.
It is an arithmetic number, because the mean of its divisors is an integer number (20365905325584).
Almost surely, 2142365511261253 is an apocalyptic number.
It is an amenable number.
142365511261253 is a deficient number, since it is larger than the sum of its proper divisors (20561731343419).
142365511261253 is an equidigital number, since it uses as much as digits as its factorization.
142365511261253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27975145411.
The product of its digits is 1296000, while the sum is 47.
The spelling of 142365511261253 in words is "one hundred forty-two trillion, three hundred sixty-five billion, five hundred eleven million, two hundred sixty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •