Base | Representation |
---|---|
bin | 10110111110101000100110… |
… | …001111101001010110001001 |
3 | 111020211100200022221102002120 |
4 | 112332220212033221112021 |
5 | 101221241340330014401 |
6 | 554534515015321453 |
7 | 30200301203223534 |
oct | 2676504617512611 |
9 | 436740608842076 |
10 | 101061222110601 |
11 | 2a223907247995 |
12 | b402412980289 |
13 | 445105610511c |
14 | 1ad5564155a1b |
15 | ba3c7abe0836 |
hex | 5bea263e9589 |
101061222110601 has 8 divisors (see below), whose sum is σ = 134751067857120. Its totient is φ = 67372762218912.
The previous prime is 101061222110599. The next prime is 101061222110609. The reversal of 101061222110601 is 106011222160101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101061222110601 - 21 = 101061222110599 is a prime.
It is a super-2 number, since 2×1010612221106012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101061222110609) 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, 346293540 + ... + 346585253.
It is an arithmetic number, because the mean of its divisors is an integer number (16843883482140).
Almost surely, 2101061222110601 is an apocalyptic number.
It is an amenable number.
101061222110601 is a deficient number, since it is larger than the sum of its proper divisors (33689845746519).
101061222110601 is an equidigital number, since it uses as much as digits as its factorization.
101061222110601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692927415.
The product of its (nonzero) digits is 288, while the sum is 24.
Adding to 101061222110601 its reverse (106011222160101), we get a palindrome (207072444270702).
The spelling of 101061222110601 in words is "one hundred one trillion, sixty-one billion, two hundred twenty-two million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •