Base | Representation |
---|---|
bin | 101111001011100100… |
… | …1101011011000111001 |
3 | 100200112011201121222021 |
4 | 1132113021223120321 |
5 | 3130000424110231 |
6 | 114313522154441 |
7 | 10214544006055 |
oct | 1362711533071 |
9 | 320464647867 |
10 | 101320144441 |
11 | 39a7364216a |
12 | 17777ab2a21 |
13 | 972917b7b9 |
14 | 4c92506c65 |
15 | 29800a8811 |
hex | 179726b639 |
101320144441 has 4 divisors (see below), whose sum is σ = 101323210212. Its totient is φ = 101317078672.
The previous prime is 101320144423. The next prime is 101320144507. The reversal of 101320144441 is 144441023101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 144441023101 = 133649 ⋅1080749.
It can be written as a sum of positive squares in 2 ways, for example, as 76412992041 + 24907152400 = 276429^2 + 157820^2 .
It is a cyclic number.
It is not a de Polignac number, because 101320144441 - 211 = 101320142393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101320144411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1482766 + ... + 1549591.
It is an arithmetic number, because the mean of its divisors is an integer number (25330802553).
Almost surely, 2101320144441 is an apocalyptic number.
It is an amenable number.
101320144441 is a deficient number, since it is larger than the sum of its proper divisors (3065771).
101320144441 is an equidigital number, since it uses as much as digits as its factorization.
101320144441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3065770.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 101320144441 its reverse (144441023101), we get a palindrome (245761167542).
The spelling of 101320144441 in words is "one hundred one billion, three hundred twenty million, one hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •