Base | Representation |
---|---|
bin | 100111101001111101111… |
… | …1000011101101001100101 |
3 | 201022001000220102012002012 |
4 | 1033103323320131221211 |
5 | 1203244100032222203 |
6 | 15331450244524005 |
7 | 1101524065064255 |
oct | 117237370355145 |
9 | 21261026365065 |
10 | 5450244414053 |
11 | 181148797a89a |
12 | 7403639b0605 |
13 | 306c56caa30a |
14 | 14bb168dd965 |
15 | 96b9018dbd8 |
hex | 4f4fbe1da65 |
5450244414053 has 8 divisors (see below), whose sum is σ = 5542730253600. Its totient is φ = 5357762201808.
The previous prime is 5450244414049. The next prime is 5450244414089. The reversal of 5450244414053 is 3504144420545.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5450244414053 - 22 = 5450244414049 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 5450244414053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5450244414023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2214158 + ... + 3975296.
It is an arithmetic number, because the mean of its divisors is an integer number (692841281700).
Almost surely, 25450244414053 is an apocalyptic number.
It is an amenable number.
5450244414053 is a deficient number, since it is larger than the sum of its proper divisors (92485839547).
5450244414053 is a wasteful number, since it uses less digits than its factorization.
5450244414053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1813651.
The product of its (nonzero) digits is 768000, while the sum is 41.
Adding to 5450244414053 its reverse (3504144420545), we get a palindrome (8954388834598).
The spelling of 5450244414053 in words is "five trillion, four hundred fifty billion, two hundred forty-four million, four hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •