Base | Representation |
---|---|
bin | 101111001011100100… |
… | …1111111101000001101 |
3 | 100200112011212211200122 |
4 | 1132113021333220031 |
5 | 3130000434233331 |
6 | 114313524034325 |
7 | 10214544502544 |
oct | 1362711775015 |
9 | 320464784618 |
10 | 101320227341 |
11 | 39a73699483 |
12 | 17777b329a5 |
13 | 97291aa458 |
14 | 4c9252915b |
15 | 29800c317b |
hex | 179727fa0d |
101320227341 has 8 divisors (see below), whose sum is σ = 107288125560. Its totient is φ = 95353205248.
The previous prime is 101320227331. The next prime is 101320227343. The reversal of 101320227341 is 143722023101.
It can be written as a sum of positive squares in 4 ways, for example, as 2846649316 + 98473578025 = 53354^2 + 313805^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-101320227341 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101320227341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101320227343) 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, 26975 + ... + 450963.
It is an arithmetic number, because the mean of its divisors is an integer number (13411015695).
Almost surely, 2101320227341 is an apocalyptic number.
It is an amenable number.
101320227341 is a deficient number, since it is larger than the sum of its proper divisors (5967898219).
101320227341 is a wasteful number, since it uses less digits than its factorization.
101320227341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438063.
The product of its (nonzero) digits is 2016, while the sum is 26.
The spelling of 101320227341 in words is "one hundred one billion, three hundred twenty million, two hundred twenty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •