Base | Representation |
---|---|
bin | 1100000011010101000… |
… | …10111011110101100101 |
3 | 1110120212122111021222021 |
4 | 12001222202323311211 |
5 | 23241041211401201 |
6 | 514123102303141 |
7 | 41626615231231 |
oct | 6015242736545 |
9 | 1416778437867 |
10 | 414104403301 |
11 | 14a69115a356 |
12 | 6830a887ab1 |
13 | 30085773004 |
14 | 160854955c1 |
15 | ab89ca0ea1 |
hex | 606a8bbd65 |
414104403301 has 4 divisors (see below), whose sum is σ = 414560969152. Its totient is φ = 413647837452.
The previous prime is 414104403257. The next prime is 414104403331. The reversal of 414104403301 is 103304401414.
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: 103304401414 = 2 ⋅51652200707.
It is a cyclic number.
It is not a de Polignac number, because 414104403301 - 231 = 411956919653 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 (414104403331) 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, 228281565 + ... + 228283378.
It is an arithmetic number, because the mean of its divisors is an integer number (103640242288).
Almost surely, 2414104403301 is an apocalyptic number.
It is an amenable number.
414104403301 is a deficient number, since it is larger than the sum of its proper divisors (456565851).
414104403301 is an equidigital number, since it uses as much as digits as its factorization.
414104403301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456565850.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 414104403301 its reverse (103304401414), we get a palindrome (517408804715).
The spelling of 414104403301 in words is "four hundred fourteen billion, one hundred four million, four hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •