Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …010010011111100010101001 |
3 | 111021000000121111211211200022 |
4 | 112333112002102133202221 |
5 | 101223041300304013001 |
6 | 555013144154450225 |
7 | 30203646221030522 |
oct | 2677260222374251 |
9 | 437000544754608 |
10 | 101110011001001 |
11 | 2a242573306412 |
12 | b40b96a133975 |
13 | 445582cc90a42 |
14 | 1ad7a71aa3849 |
15 | ba51840a311b |
hex | 5bf58249f8a9 |
101110011001001 has 8 divisors (see below), whose sum is σ = 102159847050240. Its totient is φ = 100060327294848.
The previous prime is 101110011000989. The next prime is 101110011001033. The reversal of 101110011001001 is 100100110011101.
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 101110011001001 - 26 = 101110011000937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101110011001001.
It is not an unprimeable number, because it can be changed into a prime (101110011001061) 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, 36751241 + ... + 39406518.
It is an arithmetic number, because the mean of its divisors is an integer number (12769980881280).
Almost surely, 2101110011001001 is an apocalyptic number.
It is an amenable number.
101110011001001 is a deficient number, since it is larger than the sum of its proper divisors (1049836049239).
101110011001001 is an equidigital number, since it uses as much as digits as its factorization.
101110011001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76171543.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110011001001 its reverse (100100110011101), we get a palindrome (201210121012102).
The spelling of 101110011001001 in words is "one hundred one trillion, one hundred ten billion, eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •