Base | Representation |
---|---|
bin | 10111111001011010000110… |
… | …001010000001000111000011 |
3 | 111210010110201201012020022221 |
4 | 113321122012022001013003 |
5 | 102233430001212143201 |
6 | 1011310153012311511 |
7 | 31065142316153440 |
oct | 2771320612010703 |
9 | 453113651166287 |
10 | 105100100506051 |
11 | 3054077a866492 |
12 | b95512b012597 |
13 | 4684b877a9881 |
14 | 1bd4c2cadc9c7 |
15 | c23d64e804a1 |
hex | 5f96862811c3 |
105100100506051 has 8 divisors (see below), whose sum is σ = 120114477949280. Its totient is φ = 90085742405568.
The previous prime is 105100100506007. The next prime is 105100100506067. The reversal of 105100100506051 is 150605001001501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105100100506051 - 213 = 105100100497859 is a prime.
It is a super-2 number, since 2×1051001005060512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105100100500051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9734335 + ... + 17463031.
It is an arithmetic number, because the mean of its divisors is an integer number (15014309743660).
Almost surely, 2105100100506051 is an apocalyptic number.
105100100506051 is a deficient number, since it is larger than the sum of its proper divisors (15014377443229).
105100100506051 is an equidigital number, since it uses as much as digits as its factorization.
105100100506051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9671373.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 105100100506051 its reverse (150605001001501), we get a palindrome (255705101507552).
The spelling of 105100100506051 in words is "one hundred five trillion, one hundred billion, one hundred million, five hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •