Base | Representation |
---|---|
bin | 10110110110100111011101… |
… | …001101111001100100110011 |
3 | 111011212200111111222010121011 |
4 | 112312213131031321210303 |
5 | 101133224433210232011 |
6 | 553433433424211351 |
7 | 30112424321016340 |
oct | 2666473515714463 |
9 | 434780444863534 |
10 | 100510241102131 |
11 | 2a031176895243 |
12 | b333684469b57 |
13 | 44110c8bc9863 |
14 | 1ab6a161d97c7 |
15 | b9477e538621 |
hex | 5b69dd379933 |
100510241102131 has 8 divisors (see below), whose sum is σ = 114881854500864. Its totient is φ = 86141879585160.
The previous prime is 100510241102119. The next prime is 100510241102177. The reversal of 100510241102131 is 131201142015001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100510241102131 - 211 = 100510241100083 is a prime.
It is a super-2 number, since 2×1005102411021312 (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 (100510241102431) 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, 812904205 + ... + 813027838.
It is an arithmetic number, because the mean of its divisors is an integer number (14360231812608).
Almost surely, 2100510241102131 is an apocalyptic number.
100510241102131 is a deficient number, since it is larger than the sum of its proper divisors (14371613398733).
100510241102131 is an equidigital number, since it uses as much as digits as its factorization.
100510241102131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1625940881.
The product of its (nonzero) digits is 240, while the sum is 22.
Adding to 100510241102131 its reverse (131201142015001), we get a palindrome (231711383117132).
The spelling of 100510241102131 in words is "one hundred trillion, five hundred ten billion, two hundred forty-one million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •