Base | Representation |
---|---|
bin | 100000100111000110001001… |
… | …000110001000001101010111 |
3 | 200210211012210010101200102101 |
4 | 200213012021012020031113 |
5 | 122244330121102003112 |
6 | 1225012050335022531 |
7 | 42132023652412363 |
oct | 4047061106101527 |
9 | 623735703350371 |
10 | 143424143000407 |
11 | 41776923733915 |
12 | 1410468736aa47 |
13 | 6204ab9695b99 |
14 | 275baa09a82a3 |
15 | 118abcee65757 |
hex | 827189188357 |
143424143000407 has 16 divisors (see below), whose sum is σ = 147604098268800. Its totient is φ = 139312523057760.
The previous prime is 143424143000371. The next prime is 143424143000419. The reversal of 143424143000407 is 704000341424341.
It is a cyclic number.
It is not a de Polignac number, because 143424143000407 - 227 = 143424008782679 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143424143000477) 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 15 ways as a sum of consecutive naturals, for example, 41592069 + ... + 44908222.
It is an arithmetic number, because the mean of its divisors is an integer number (9225256141800).
Almost surely, 2143424143000407 is an apocalyptic number.
143424143000407 is a deficient number, since it is larger than the sum of its proper divisors (4179955268393).
143424143000407 is a wasteful number, since it uses less digits than its factorization.
143424143000407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86500686.
The product of its (nonzero) digits is 129024, while the sum is 37.
Adding to 143424143000407 its reverse (704000341424341), we get a palindrome (847424484424748).
The spelling of 143424143000407 in words is "one hundred forty-three trillion, four hundred twenty-four billion, one hundred forty-three million, four hundred seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •