Base | Representation |
---|---|
bin | 1000010101101100111… |
… | …0011010001100101011 |
3 | 111200210100021211122110 |
4 | 2011123032122030223 |
5 | 4321401143042442 |
6 | 145451553453403 |
7 | 13231140342423 |
oct | 2053316321453 |
9 | 450710254573 |
10 | 143264424747 |
11 | 5583803a834 |
12 | 23922b71263 |
13 | 10681c99782 |
14 | 6d10dc7483 |
15 | 3ad75e869c |
hex | 215b39a32b |
143264424747 has 8 divisors (see below), whose sum is σ = 194150696080. Its totient is φ = 93943884960.
The previous prime is 143264424707. The next prime is 143264424761. The reversal of 143264424747 is 747424462341.
143264424747 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 143264424747 - 235 = 108904686379 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143264424696 and 143264424705.
It is not an unprimeable number, because it can be changed into a prime (143264424707) 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, 391432672 + ... + 391433037.
It is an arithmetic number, because the mean of its divisors is an integer number (24268837010).
Almost surely, 2143264424747 is an apocalyptic number.
143264424747 is a deficient number, since it is larger than the sum of its proper divisors (50886271333).
143264424747 is an equidigital number, since it uses as much as digits as its factorization.
143264424747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782865773.
The product of its digits is 3612672, while the sum is 48.
The spelling of 143264424747 in words is "one hundred forty-three billion, two hundred sixty-four million, four hundred twenty-four thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •