Base | Representation |
---|---|
bin | 1000010100001111001… |
… | …1110110010001010001 |
3 | 111122202222002120000112 |
4 | 2011003303312101101 |
5 | 4320100111221443 |
6 | 145345001531105 |
7 | 13215330304532 |
oct | 2050363662121 |
9 | 448688076015 |
10 | 142871585873 |
11 | 55656316105 |
12 | 238334a3a95 |
13 | 1061b794833 |
14 | 6cb4b68689 |
15 | 3ab2d9bb18 |
hex | 2143cf6451 |
142871585873 has 4 divisors (see below), whose sum is σ = 144680087040. Its totient is φ = 141063084708.
The previous prime is 142871585833. The next prime is 142871585887. The reversal of 142871585873 is 378585178241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 378585178241 = 5281 ⋅71688161.
It is a cyclic number.
It is not a de Polignac number, because 142871585873 - 28 = 142871585617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142871585833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 904250465 + ... + 904250622.
It is an arithmetic number, because the mean of its divisors is an integer number (36170021760).
Almost surely, 2142871585873 is an apocalyptic number.
It is an amenable number.
142871585873 is a deficient number, since it is larger than the sum of its proper divisors (1808501167).
142871585873 is an equidigital number, since it uses as much as digits as its factorization.
142871585873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1808501166.
The product of its digits is 15052800, while the sum is 59.
The spelling of 142871585873 in words is "one hundred forty-two billion, eight hundred seventy-one million, five hundred eighty-five thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •