Base | Representation |
---|---|
bin | 1100101110111… |
… | …0011011101011 |
3 | 10201111021110111 |
4 | 3023232123223 |
5 | 102132433134 |
6 | 5144355151 |
7 | 1215636634 |
oct | 313563353 |
9 | 121437414 |
10 | 53405419 |
11 | 28167311 |
12 | 15a75ab7 |
13 | b0ab452 |
14 | 714288b |
15 | 4a4dc64 |
hex | 32ee6eb |
53405419 has 4 divisors (see below), whose sum is σ = 54157680. Its totient is φ = 52653160.
The previous prime is 53405399. The next prime is 53405459. The reversal of 53405419 is 91450435.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 91450435 = 5 ⋅18290087.
It is a cyclic number.
It is not a de Polignac number, because 53405419 - 215 = 53372651 is a prime.
It is a super-2 number, since 2×534054192 = 5704277557131122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53405459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 376024 + ... + 376165.
It is an arithmetic number, because the mean of its divisors is an integer number (13539420).
Almost surely, 253405419 is an apocalyptic number.
53405419 is a deficient number, since it is larger than the sum of its proper divisors (752261).
53405419 is an equidigital number, since it uses as much as digits as its factorization.
53405419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752260.
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 53405419 is about 7307.9011350729. The cubic root of 53405419 is about 376.5839232281.
It can be divided in two parts, 53405 and 419, that added together give a square (53824 = 2322).
The spelling of 53405419 in words is "fifty-three million, four hundred five thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •