Base | Representation |
---|---|
bin | 10100110011111100000… |
… | …110100110001110011111 |
3 | 12001201111012222000200011 |
4 | 110303330012212032133 |
5 | 141412431113331033 |
6 | 3013001132544051 |
7 | 205216444426003 |
oct | 24637406461637 |
9 | 5051435860604 |
10 | 1430158730143 |
11 | 501588356660 |
12 | 1b1211322027 |
13 | a4b2bb36720 |
14 | 4d311b72703 |
15 | 27305b8eccd |
hex | 14cfc1a639f |
1430158730143 has 32 divisors (see below), whose sum is σ = 1709280921600. Its totient is φ = 1179366153600.
The previous prime is 1430158730081. The next prime is 1430158730153. The reversal of 1430158730143 is 3410378510341.
It is a cyclic number.
It is not a de Polignac number, because 1430158730143 - 29 = 1430158729631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1430158730096 and 1430158730105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430158730153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24514098 + ... + 24572368.
It is an arithmetic number, because the mean of its divisors is an integer number (53415028800).
Almost surely, 21430158730143 is an apocalyptic number.
1430158730143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1430158730143 is a deficient number, since it is larger than the sum of its proper divisors (279122191457).
1430158730143 is a wasteful number, since it uses less digits than its factorization.
1430158730143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61263.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 1430158730143 in words is "one trillion, four hundred thirty billion, one hundred fifty-eight million, seven hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •