Base | Representation |
---|---|
bin | 1100000001101001010… |
… | …10000001111100001001 |
3 | 1110111112122020202200022 |
4 | 12000310222001330021 |
5 | 23232213233344031 |
6 | 513453244150225 |
7 | 41565326355062 |
oct | 6006452017411 |
9 | 1414478222608 |
10 | 413200293641 |
11 | 14a267880393 |
12 | 680b7b38375 |
13 | 2cc7036ab95 |
14 | 15ddb389569 |
15 | ab3571197b |
hex | 6034a81f09 |
413200293641 has 4 divisors (see below), whose sum is σ = 413538152832. Its totient is φ = 412862434452.
The previous prime is 413200293619. The next prime is 413200293643. The reversal of 413200293641 is 146392002314.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 146392002314 = 2 ⋅73196001157.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413200293641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413200293643) 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, 168927761 + ... + 168930206.
It is an arithmetic number, because the mean of its divisors is an integer number (103384538208).
Almost surely, 2413200293641 is an apocalyptic number.
It is an amenable number.
413200293641 is a deficient number, since it is larger than the sum of its proper divisors (337859191).
413200293641 is a wasteful number, since it uses less digits than its factorization.
413200293641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337859190.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 413200293641 its reverse (146392002314), we get a palindrome (559592295955).
The spelling of 413200293641 in words is "four hundred thirteen billion, two hundred million, two hundred ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •