Base | Representation |
---|---|
bin | 101111000101001110… |
… | …1001111000010000001 |
3 | 100122222022222021100021 |
4 | 1132022131033002001 |
5 | 3124031413323421 |
6 | 114240433253441 |
7 | 10206346512454 |
oct | 1361235170201 |
9 | 318868867307 |
10 | 101107167361 |
11 | 399743a6352 |
12 | 17718704281 |
13 | 96c3ccc865 |
14 | 4c7210749b |
15 | 296b539341 |
hex | 178a74f081 |
101107167361 has 8 divisors (see below), whose sum is σ = 107058066984. Its totient is φ = 95156647680.
The previous prime is 101107167349. The next prime is 101107167383. The reversal of 101107167361 is 163761701101.
It can be written as a sum of positive squares in 4 ways, for example, as 15764309136 + 85342858225 = 125556^2 + 292135^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101107167361 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101107167061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 596991 + ... + 747403.
It is an arithmetic number, because the mean of its divisors is an integer number (13382258373).
Almost surely, 2101107167361 is an apocalyptic number.
It is an amenable number.
101107167361 is a deficient number, since it is larger than the sum of its proper divisors (5950899623).
101107167361 is a wasteful number, since it uses less digits than its factorization.
101107167361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189971.
The product of its (nonzero) digits is 5292, while the sum is 34.
Adding to 101107167361 its reverse (163761701101), we get a palindrome (264868868462).
The spelling of 101107167361 in words is "one hundred one billion, one hundred seven million, one hundred sixty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •