Base | Representation |
---|---|
bin | 1001001011111010101011… |
… | …0100100111110011011111 |
3 | 1022202120201122102021210000 |
4 | 2102332222310213303133 |
5 | 2310440441003043033 |
6 | 33252010203345343 |
7 | 2061503456512263 |
oct | 222765264476337 |
9 | 38676648367700 |
10 | 10100334034143 |
11 | 32445892799a1 |
12 | 1171619522253 |
13 | 5835c3c20cb2 |
14 | 26cc046a20a3 |
15 | 127aed660a13 |
hex | 92faad27cdf |
10100334034143 has 20 divisors (see below), whose sum is σ = 15300662520528. Its totient is φ = 6638717201760.
The previous prime is 10100334033997. The next prime is 10100334034279. The reversal of 10100334034143 is 34143043300101.
10100334034143 is a `hidden beast` number, since 10 + 100 + 3 + 3 + 403 + 4 + 143 = 666.
It is a de Polignac number, because none of the positive numbers 2k-10100334034143 is a prime.
It is a super-3 number, since 3×101003340341433 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100334039143) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 878131446 + ... + 878142947.
Almost surely, 210100334034143 is an apocalyptic number.
10100334034143 is a deficient number, since it is larger than the sum of its proper divisors (5200328486385).
10100334034143 is an equidigital number, since it uses as much as digits as its factorization.
10100334034143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1756274476 (or 1756274467 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 10100334034143 its reverse (34143043300101), we get a palindrome (44243377334244).
The spelling of 10100334034143 in words is "ten trillion, one hundred billion, three hundred thirty-four million, thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •