Base | Representation |
---|---|
bin | 10110110101011100111100… |
… | …010000110000111100111111 |
3 | 111011121000222111102120111222 |
4 | 112311130330100300330333 |
5 | 101130422103203411033 |
6 | 553333002240503555 |
7 | 30103562520012560 |
oct | 2665347420607477 |
9 | 434530874376458 |
10 | 100430231310143 |
11 | 2a000249400309 |
12 | b32007531abbb |
13 | 44066b7a46a87 |
14 | 1ab2bc6032167 |
15 | b9264a283598 |
hex | 5b573c430f3f |
100430231310143 has 16 divisors (see below), whose sum is σ = 115923396442176. Its totient is φ = 85223704358400.
The previous prime is 100430231310131. The next prime is 100430231310161. The reversal of 100430231310143 is 341013132034001.
It is a cyclic number.
It is not a de Polignac number, because 100430231310143 - 230 = 100429157568319 is a prime.
It is a super-2 number, since 2×1004302313101432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100430231315143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2700305 + ... + 14427477.
It is an arithmetic number, because the mean of its divisors is an integer number (7245212277636).
Almost surely, 2100430231310143 is an apocalyptic number.
100430231310143 is a deficient number, since it is larger than the sum of its proper divisors (15493165132033).
100430231310143 is a wasteful number, since it uses less digits than its factorization.
100430231310143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11739394.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 100430231310143 its reverse (341013132034001), we get a palindrome (441443363344144).
The spelling of 100430231310143 in words is "one hundred trillion, four hundred thirty billion, two hundred thirty-one million, three hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •