Base | Representation |
---|---|
bin | 100110011110100001… |
… | …001111100101111101 |
3 | 10221122020222211222121 |
4 | 212132201033211331 |
5 | 1134102420023123 |
6 | 30551323042541 |
7 | 2661543036124 |
oct | 463641174575 |
9 | 127566884877 |
10 | 41314220413 |
11 | 16580889314 |
12 | 8010070451 |
13 | 3b8542908b |
14 | 1ddcd50abb |
15 | 111c08575d |
hex | 99e84f97d |
41314220413 has 4 divisors (see below), whose sum is σ = 41314670460. Its totient is φ = 41313770368.
The previous prime is 41314220411. The next prime is 41314220489. The reversal of 41314220413 is 31402241314.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 21432374404 + 19881846009 = 146398^2 + 141003^2 .
It is a cyclic number.
It is not a de Polignac number, because 41314220413 - 21 = 41314220411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41314220411) 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, 32308 + ... + 289261.
It is an arithmetic number, because the mean of its divisors is an integer number (10328667615).
Almost surely, 241314220413 is an apocalyptic number.
It is an amenable number.
41314220413 is a deficient number, since it is larger than the sum of its proper divisors (450047).
41314220413 is a wasteful number, since it uses less digits than its factorization.
41314220413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450046.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 41314220413 its reverse (31402241314), we get a palindrome (72716461727).
The spelling of 41314220413 in words is "forty-one billion, three hundred fourteen million, two hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •