Base | Representation |
---|---|
bin | 1010000100000111… |
… | …00111101010011001 |
3 | 111221120002122001022 |
4 | 11002003213222121 |
5 | 42031210244231 |
6 | 2252053332225 |
7 | 250616355644 |
oct | 50203475231 |
9 | 14846078038 |
10 | 5403212441 |
11 | 2322a77530 |
12 | 1069637075 |
13 | 681556433 |
14 | 393860a5b |
15 | 219551c7b |
hex | 1420e7a99 |
5403212441 has 4 divisors (see below), whose sum is σ = 5894413584. Its totient is φ = 4912011300.
The previous prime is 5403212413. The next prime is 5403212467. The reversal of 5403212441 is 1442123045.
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.
It is a cyclic number.
It is not a de Polignac number, because 5403212441 - 26 = 5403212377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5403212441.
It is not an unprimeable number, because it can be changed into a prime (5403212411) 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, 245600555 + ... + 245600576.
It is an arithmetic number, because the mean of its divisors is an integer number (1473603396).
Almost surely, 25403212441 is an apocalyptic number.
It is an amenable number.
5403212441 is a deficient number, since it is larger than the sum of its proper divisors (491201143).
5403212441 is a wasteful number, since it uses less digits than its factorization.
5403212441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491201142.
The product of its (nonzero) digits is 3840, while the sum is 26.
The square root of 5403212441 is about 73506.5469261072. The cubic root of 5403212441 is about 1754.7584715357.
Adding to 5403212441 its reverse (1442123045), we get a palindrome (6845335486).
The spelling of 5403212441 in words is "five billion, four hundred three million, two hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •