Base | Representation |
---|---|
bin | 10110110000101110001001… |
… | …001110101101001010001011 |
3 | 111010102221202220002220011221 |
4 | 112300232021032231022023 |
5 | 101110110223401221301 |
6 | 552523352253502511 |
7 | 30041232552565402 |
oct | 2660561116551213 |
9 | 433387686086157 |
10 | 100105105101451 |
11 | 2999537810558a |
12 | b2890591a1a37 |
13 | 43b1b424c2a78 |
14 | 1aa1181c92639 |
15 | b88e6bcc1da1 |
hex | 5b0b893ad28b |
100105105101451 has 8 divisors (see below), whose sum is σ = 106019625971520. Its totient is φ = 94193471484288.
The previous prime is 100105105101409. The next prime is 100105105101461. The reversal of 100105105101451 is 154101501501001.
It is a happy number.
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 100105105101451 - 29 = 100105105100939 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100105105101461) 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 7 ways as a sum of consecutive naturals, for example, 721741836 + ... + 721880521.
It is an arithmetic number, because the mean of its divisors is an integer number (13252453246440).
Almost surely, 2100105105101451 is an apocalyptic number.
100105105101451 is a deficient number, since it is larger than the sum of its proper divisors (5914520870069).
100105105101451 is a wasteful number, since it uses less digits than its factorization.
100105105101451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443626453.
The product of its (nonzero) digits is 500, while the sum is 25.
Adding to 100105105101451 its reverse (154101501501001), we get a palindrome (254206606602452).
The spelling of 100105105101451 in words is "one hundred trillion, one hundred five billion, one hundred five million, one hundred one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •