Base | Representation |
---|---|
bin | 10100110011110010101… |
… | …001101100001100000011 |
3 | 12001201002011120200211012 |
4 | 110303302221230030003 |
5 | 141412120020014233 |
6 | 3012533310111135 |
7 | 205212510532634 |
oct | 24636251541403 |
9 | 5051064520735 |
10 | 1430000157443 |
11 | 501506899640 |
12 | 1b11881ab4ab |
13 | a4b05025820 |
14 | 4d2d8a9588b |
15 | 272e6cba548 |
hex | 14cf2a6c303 |
1430000157443 has 8 divisors (see below), whose sum is σ = 1680000185136. Its totient is φ = 1200000132000.
The previous prime is 1430000157433. The next prime is 1430000157451. The reversal of 1430000157443 is 3447510000341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1430000157443 - 24 = 1430000157427 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1430000157433) 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, 5000000408 + ... + 5000000693.
It is an arithmetic number, because the mean of its divisors is an integer number (210000023142).
Almost surely, 21430000157443 is an apocalyptic number.
1430000157443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1430000157443 is a deficient number, since it is larger than the sum of its proper divisors (250000027693).
1430000157443 is a wasteful number, since it uses less digits than its factorization.
1430000157443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000001125.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 1430000157443 its reverse (3447510000341), we get a palindrome (4877510157784).
The spelling of 1430000157443 in words is "one trillion, four hundred thirty billion, one hundred fifty-seven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •