Base | Representation |
---|---|
bin | 100000011010101010010… |
… | …1010000111000111110001 |
3 | 120202220220121121211200222 |
4 | 1000311110222013013301 |
5 | 1040443424130130223 |
6 | 13250423123222425 |
7 | 636612344102414 |
oct | 100652452070761 |
9 | 16686817554628 |
10 | 4455301411313 |
11 | 1468534551885 |
12 | 5bb573517a15 |
13 | 26419660865c |
14 | 1158cdd53b7b |
15 | 7ad5c88c0c8 |
hex | 40d54a871f1 |
4455301411313 has 8 divisors (see below), whose sum is σ = 4519402257600. Its totient is φ = 4391238068560.
The previous prime is 4455301411283. The next prime is 4455301411367. The reversal of 4455301411313 is 3131141035544.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4455301411313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4455301411513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9136538 + ... + 9611811.
It is an arithmetic number, because the mean of its divisors is an integer number (564925282200).
Almost surely, 24455301411313 is an apocalyptic number.
It is an amenable number.
4455301411313 is a deficient number, since it is larger than the sum of its proper divisors (64100846287).
4455301411313 is a wasteful number, since it uses less digits than its factorization.
4455301411313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18751767.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 4455301411313 its reverse (3131141035544), we get a palindrome (7586442446857).
The spelling of 4455301411313 in words is "four trillion, four hundred fifty-five billion, three hundred one million, four hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •