Base | Representation |
---|---|
bin | 100000010111111110111101… |
… | …100001000001101011011001 |
3 | 200200010221020002111112122201 |
4 | 200113332331201001223121 |
5 | 122130321242414144040 |
6 | 1222455020555450201 |
7 | 41664010621661140 |
oct | 4027767541015331 |
9 | 620127202445581 |
10 | 142385640381145 |
11 | 41406458011227 |
12 | 13b7735aa56961 |
13 | 615aba6630ac5 |
14 | 2723704bb4757 |
15 | 116db9d3e5a9a |
hex | 817fbd841ad9 |
142385640381145 has 8 divisors (see below), whose sum is σ = 195271735379904. Its totient is φ = 97635867689904.
The previous prime is 142385640381143. The next prime is 142385640381157. The reversal of 142385640381145 is 541183046583241.
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 142385640381145 - 21 = 142385640381143 is a prime.
It is a super-2 number, since 2×1423856403811452 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142385640381143) 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, 2034080576839 + ... + 2034080576908.
It is an arithmetic number, because the mean of its divisors is an integer number (24408966922488).
Almost surely, 2142385640381145 is an apocalyptic number.
It is an amenable number.
142385640381145 is a deficient number, since it is larger than the sum of its proper divisors (52886094998759).
142385640381145 is an equidigital number, since it uses as much as digits as its factorization.
142385640381145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4068161153759.
The product of its (nonzero) digits is 11059200, while the sum is 55.
The spelling of 142385640381145 in words is "one hundred forty-two trillion, three hundred eighty-five billion, six hundred forty million, three hundred eighty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •