Base | Representation |
---|---|
bin | 111010001110010110100… |
… | …011000111100101101101 |
3 | 112011111122100110000211202 |
4 | 322032112203013211231 |
5 | 1011023313411403401 |
6 | 12302033135255245 |
7 | 562033662514541 |
oct | 72162643074555 |
9 | 15144570400752 |
10 | 4001140341101 |
11 | 130296845a832 |
12 | 54754597a525 |
13 | 2303c9132297 |
14 | db92897da21 |
15 | 6e12b15e06b |
hex | 3a3968c796d |
4001140341101 has 2 divisors, whose sum is σ = 4001140341102. Its totient is φ = 4001140341100.
The previous prime is 4001140341083. The next prime is 4001140341131. The reversal of 4001140341101 is 1011430411004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3945586322500 + 55554018601 = 1986350^2 + 235699^2 .
It is a cyclic number.
It is not a de Polignac number, because 4001140341101 - 214 = 4001140324717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4001140341131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000570170550 + 2000570170551.
It is an arithmetic number, because the mean of its divisors is an integer number (2000570170551).
Almost surely, 24001140341101 is an apocalyptic number.
It is an amenable number.
4001140341101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4001140341101 is an equidigital number, since it uses as much as digits as its factorization.
4001140341101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 4001140341101 its reverse (1011430411004), we get a palindrome (5012570752105).
The spelling of 4001140341101 in words is "four trillion, one billion, one hundred forty million, three hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •