Base | Representation |
---|---|
bin | 100111100101110111110… |
… | …1101011001110001111001 |
3 | 201021012100000122112121121 |
4 | 1033023233231121301321 |
5 | 1203123042231102213 |
6 | 15323433455305241 |
7 | 1101063132001105 |
oct | 117135755316171 |
9 | 21235300575547 |
10 | 5441450253433 |
11 | 180878489a857 |
12 | 73a70a81b221 |
13 | 30618507a18c |
14 | 14b52098a905 |
15 | 968280c188d |
hex | 4f2efb59c79 |
5441450253433 has 16 divisors (see below), whose sum is σ = 5653462763520. Its totient is φ = 5233899185424.
The previous prime is 5441450253431. The next prime is 5441450253439. The reversal of 5441450253433 is 3343520541445.
It is a cyclic number.
It is not a de Polignac number, because 5441450253433 - 21 = 5441450253431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
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 5441450253433.
It is not an unprimeable number, because it can be changed into a prime (5441450253431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2639041 + ... + 4224622.
It is an arithmetic number, because the mean of its divisors is an integer number (353341422720).
Almost surely, 25441450253433 is an apocalyptic number.
It is an amenable number.
5441450253433 is a deficient number, since it is larger than the sum of its proper divisors (212012510087).
5441450253433 is a wasteful number, since it uses less digits than its factorization.
5441450253433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6863988.
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 5441450253433 its reverse (3343520541445), we get a palindrome (8784970794878).
The spelling of 5441450253433 in words is "five trillion, four hundred forty-one billion, four hundred fifty million, two hundred fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •