Base | Representation |
---|---|
bin | 10110110110110001011001… |
… | …101110100101111111011111 |
3 | 111011220201001202011102220010 |
4 | 112312301121232211333133 |
5 | 101133413321003411142 |
6 | 553442401221454303 |
7 | 30113253051010125 |
oct | 2666613156457737 |
9 | 434821052142803 |
10 | 100520919982047 |
11 | 2a035756833834 |
12 | b335764871393 |
13 | 441210b440206 |
14 | 1ab734a599915 |
15 | b94ba6ce5e9c |
hex | 5b6c59ba5fdf |
100520919982047 has 8 divisors (see below), whose sum is σ = 134033369968944. Its totient is φ = 67011208324928.
The previous prime is 100520919982009. The next prime is 100520919982073. The reversal of 100520919982047 is 740289919025001.
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 100520919982047 - 210 = 100520919981023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100520919902047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 684496788 + ... + 684643625.
It is an arithmetic number, because the mean of its divisors is an integer number (16754171246118).
Almost surely, 2100520919982047 is an apocalyptic number.
100520919982047 is a deficient number, since it is larger than the sum of its proper divisors (33512449986897).
100520919982047 is a wasteful number, since it uses less digits than its factorization.
100520919982047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1369164889.
The product of its (nonzero) digits is 3265920, while the sum is 57.
The spelling of 100520919982047 in words is "one hundred trillion, five hundred twenty billion, nine hundred nineteen million, nine hundred eighty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •