Base | Representation |
---|---|
bin | 1000010100011111001… |
… | …1110000110110010011 |
3 | 111122221122022220121120 |
4 | 2011013303300312103 |
5 | 4320214300010111 |
6 | 145355355453323 |
7 | 13220103445464 |
oct | 2050763606623 |
9 | 448848286546 |
10 | 142938672531 |
11 | 55690177326 |
12 | 23851a57243 |
13 | 1062c653295 |
14 | 6cbda2cd6b |
15 | 3ab8bee406 |
hex | 2147cf0d93 |
142938672531 has 8 divisors (see below), whose sum is σ = 190716612864. Its totient is φ = 95226590280.
The previous prime is 142938672521. The next prime is 142938672559. The reversal of 142938672531 is 135276839241.
142938672531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142938672531 - 213 = 142938664339 is a prime.
It is a super-2 number, since 2×1429386725312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (142938672521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16459455 + ... + 16468136.
It is an arithmetic number, because the mean of its divisors is an integer number (23839576608).
Almost surely, 2142938672531 is an apocalyptic number.
142938672531 is a deficient number, since it is larger than the sum of its proper divisors (47777940333).
142938672531 is a wasteful number, since it uses less digits than its factorization.
142938672531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32929041.
The product of its digits is 2177280, while the sum is 51.
The spelling of 142938672531 in words is "one hundred forty-two billion, nine hundred thirty-eight million, six hundred seventy-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •