Base | Representation |
---|---|
bin | 1001011111010011100010… |
… | …0010000011001101101111 |
3 | 1100221102111020222100211212 |
4 | 2113310320202003031233 |
5 | 2331420123021342033 |
6 | 34105014313505035 |
7 | 2124534654560666 |
oct | 227647042031557 |
9 | 40842436870755 |
10 | 10433424012143 |
11 | 3362876946450 |
12 | 120609871217b |
13 | 5a8b38341132 |
14 | 280da2397ddd |
15 | 1315e5d62748 |
hex | 97d3888336f |
10433424012143 has 16 divisors (see below), whose sum is σ = 11495808783360. Its totient is φ = 9390040788000.
The previous prime is 10433424012119. The next prime is 10433424012181. The reversal of 10433424012143 is 34121042433401.
It is a cyclic number.
It is not a de Polignac number, because 10433424012143 - 214 = 10433423995759 is a prime.
It is a super-2 number, since 2×104334240121432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10433424042143) 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 15 ways as a sum of consecutive naturals, for example, 10268246 + ... + 11238492.
It is an arithmetic number, because the mean of its divisors is an integer number (718488048960).
Almost surely, 210433424012143 is an apocalyptic number.
10433424012143 is a deficient number, since it is larger than the sum of its proper divisors (1062384771217).
10433424012143 is a wasteful number, since it uses less digits than its factorization.
10433424012143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 980038.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 10433424012143 its reverse (34121042433401), we get a palindrome (44554466445544).
The spelling of 10433424012143 in words is "ten trillion, four hundred thirty-three billion, four hundred twenty-four million, twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •