Base | Representation |
---|---|
bin | 100000010111100111010001… |
… | …001011011100010010011001 |
3 | 200200001111120010210211022011 |
4 | 200113213101023130102121 |
5 | 122124412142304313023 |
6 | 1222435212342025521 |
7 | 41662120323152104 |
oct | 4027472113342231 |
9 | 620044503724264 |
10 | 142360200463513 |
11 | 413a669292560a |
12 | 13b7243b1182a1 |
13 | 6158680c1aac6 |
14 | 27223b023573b |
15 | 116d1aecc750d |
hex | 8179d12dc499 |
142360200463513 has 8 divisors (see below), whose sum is σ = 142481959173576. Its totient is φ = 142238443814400.
The previous prime is 142360200463489. The next prime is 142360200463529. The reversal of 142360200463513 is 315364002063241.
It can be written as a sum of positive squares in 4 ways, for example, as 100788809445769 + 41571391017744 = 10039363^2 + 6447588^2 .
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-142360200463513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142360200463543) 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, 158696023 + ... + 159590563.
It is an arithmetic number, because the mean of its divisors is an integer number (17810244896697).
Almost surely, 2142360200463513 is an apocalyptic number.
It is an amenable number.
142360200463513 is a deficient number, since it is larger than the sum of its proper divisors (121758710063).
142360200463513 is a wasteful number, since it uses less digits than its factorization.
142360200463513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1030475.
The product of its (nonzero) digits is 311040, while the sum is 40.
The spelling of 142360200463513 in words is "one hundred forty-two trillion, three hundred sixty billion, two hundred million, four hundred sixty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •