Base | Representation |
---|---|
bin | 1111010010100000… |
… | …0011101001010101 |
3 | 101121000122222120221 |
4 | 3310220003221111 |
5 | 31401130011042 |
6 | 1515125554341 |
7 | 203463424546 |
oct | 36450035125 |
9 | 11530588527 |
10 | 4104141397 |
11 | 18167541a4 |
12 | 9665759b1 |
13 | 505385245 |
14 | 2ad1024cd |
15 | 190496d67 |
hex | f4a03a55 |
4104141397 has 2 divisors, whose sum is σ = 4104141398. Its totient is φ = 4104141396.
The previous prime is 4104141389. The next prime is 4104141487. The reversal of 4104141397 is 7931414014.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2705456196 + 1398685201 = 52014^2 + 37399^2 .
It is a cyclic number.
It is not a de Polignac number, because 4104141397 - 23 = 4104141389 is a prime.
It is a super-3 number, since 3×41041413973 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4104121397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2052070698 + 2052070699.
It is an arithmetic number, because the mean of its divisors is an integer number (2052070699).
Almost surely, 24104141397 is an apocalyptic number.
It is an amenable number.
4104141397 is a deficient number, since it is larger than the sum of its proper divisors (1).
4104141397 is an equidigital number, since it uses as much as digits as its factorization.
4104141397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 34.
The square root of 4104141397 is about 64063.5730895491. The cubic root of 4104141397 is about 1601.0593761559.
It can be divided in two parts, 4 and 104141397, that added together give a palindrome (104141401).
The spelling of 4104141397 in words is "four billion, one hundred four million, one hundred forty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •