Base | Representation |
---|---|
bin | 100000010111000100111101… |
… | …100111010011010000001001 |
3 | 200122220222111000101102001012 |
4 | 200113010331213103100021 |
5 | 122123311222420001301 |
6 | 1222410241250133305 |
7 | 41656344442656560 |
oct | 4027047547232011 |
9 | 618828430342035 |
10 | 142323365000201 |
11 | 413920001a8850 |
12 | 13b6727ab81235 |
13 | 615506066b478 |
14 | 27206b8060bd7 |
15 | 116c256035ebb |
hex | 81713d9d3409 |
142323365000201 has 8 divisors (see below), whose sum is σ = 177442117402944. Its totient is φ = 110901323376720.
The previous prime is 142323365000189. The next prime is 142323365000209. The reversal of 142323365000201 is 102000563323241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142323365000201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142323365000209) 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, 924177694730 + ... + 924177694883.
It is an arithmetic number, because the mean of its divisors is an integer number (22180264675368).
Almost surely, 2142323365000201 is an apocalyptic number.
142323365000201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142323365000201 is a deficient number, since it is larger than the sum of its proper divisors (35118752402743).
142323365000201 is a wasteful number, since it uses less digits than its factorization.
142323365000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1848355389631.
The product of its (nonzero) digits is 25920, while the sum is 32.
The spelling of 142323365000201 in words is "one hundred forty-two trillion, three hundred twenty-three billion, three hundred sixty-five million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •