Base | Representation |
---|---|
bin | 100110100011101101… |
… | …000110010001000101 |
3 | 10221212022200120210002 |
4 | 212203231012101011 |
5 | 1134242202322041 |
6 | 31004111411045 |
7 | 2663650340606 |
oct | 464355062105 |
9 | 127768616702 |
10 | 41401214021 |
11 | 166159a6962 |
12 | 8035223a85 |
13 | 3b9a46779b |
14 | 200a717dad |
15 | 1124a1b59b |
hex | 9a3b46445 |
41401214021 has 4 divisors (see below), whose sum is σ = 41402051532. Its totient is φ = 41400376512.
The previous prime is 41401214003. The next prime is 41401214089. The reversal of 41401214021 is 12041210414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35687365921 + 5713848100 = 188911^2 + 75590^2 .
It is a cyclic number.
It is not a de Polignac number, because 41401214021 - 26 = 41401213957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41401213984 and 41401214002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41401244021) 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, 339620 + ... + 445133.
It is an arithmetic number, because the mean of its divisors is an integer number (10350512883).
Almost surely, 241401214021 is an apocalyptic number.
It is an amenable number.
41401214021 is a deficient number, since it is larger than the sum of its proper divisors (837511).
41401214021 is an equidigital number, since it uses as much as digits as its factorization.
41401214021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 837510.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 41401214021 its reverse (12041210414), we get a palindrome (53442424435).
The spelling of 41401214021 in words is "forty-one billion, four hundred one million, two hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •