Base | Representation |
---|---|
bin | 10100011001011010000001… |
… | …01000011011100001100101 |
3 | 12212210221112111121112112220 |
4 | 22030231000220123201211 |
5 | 21334334310004444303 |
6 | 235221214050102553 |
7 | 12306360516550011 |
oct | 1214550050334145 |
9 | 185727474545486 |
10 | 44853427812453 |
11 | 13323260745737 |
12 | 5044a8a27aa59 |
13 | 1c048772c2770 |
14 | b10cbb83b541 |
15 | 52bb1975c053 |
hex | 28cb40a1b865 |
44853427812453 has 16 divisors (see below), whose sum is σ = 65620109197440. Its totient is φ = 27081314904384.
The previous prime is 44853427812409. The next prime is 44853427812497. The reversal of 44853427812453 is 35421872435844.
It is an interprime number because it is at equal distance from previous prime (44853427812409) and next prime (44853427812497).
It is not a de Polignac number, because 44853427812453 - 228 = 44853159376997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44853427810453) 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 15 ways as a sum of consecutive naturals, for example, 10849883713 + ... + 10849887846.
It is an arithmetic number, because the mean of its divisors is an integer number (4101256824840).
Almost surely, 244853427812453 is an apocalyptic number.
It is an amenable number.
44853427812453 is a deficient number, since it is larger than the sum of its proper divisors (20766681384987).
44853427812453 is a wasteful number, since it uses less digits than its factorization.
44853427812453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21699771628.
The product of its digits is 103219200, while the sum is 60.
The spelling of 44853427812453 in words is "forty-four trillion, eight hundred fifty-three billion, four hundred twenty-seven million, eight hundred twelve thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •