Base | Representation |
---|---|
bin | 1010001001010001… |
… | …11001111111001101 |
3 | 112001120121222000102 |
4 | 11010220321333031 |
5 | 42123303310021 |
6 | 2300242140445 |
7 | 251653560020 |
oct | 50450717715 |
9 | 15046558012 |
10 | 5446541261 |
11 | 2345481077 |
12 | 1080051725 |
13 | 68a5171a5 |
14 | 3994dd1b7 |
15 | 21d26000b |
hex | 144a39fcd |
5446541261 has 4 divisors (see below), whose sum is σ = 6224618592. Its totient is φ = 4668463932.
The previous prime is 5446541239. The next prime is 5446541299. The reversal of 5446541261 is 1621456445.
It is a happy number.
5446541261 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5446541261 - 210 = 5446540237 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 (5446541231) 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, 389038655 + ... + 389038668.
It is an arithmetic number, because the mean of its divisors is an integer number (1556154648).
Almost surely, 25446541261 is an apocalyptic number.
It is an amenable number.
5446541261 is a deficient number, since it is larger than the sum of its proper divisors (778077331).
5446541261 is an equidigital number, since it uses as much as digits as its factorization.
5446541261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 778077330.
The product of its digits is 115200, while the sum is 38.
The square root of 5446541261 is about 73800.6860469467. The cubic root of 5446541261 is about 1759.4365083353.
The spelling of 5446541261 in words is "five billion, four hundred forty-six million, five hundred forty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •