Base | Representation |
---|---|
bin | 111110110110011… |
… | …010011100111001 |
3 | 2201111010200112202 |
4 | 332312122130321 |
5 | 4124414422023 |
6 | 252344315545 |
7 | 35062455443 |
oct | 7666323471 |
9 | 2644120482 |
10 | 1054451513 |
11 | 4a1235035 |
12 | 255172bb5 |
13 | 13a5c380b |
14 | a0083493 |
15 | 6288a128 |
hex | 3ed9a739 |
1054451513 has 8 divisors (see below), whose sum is σ = 1091188800. Its totient is φ = 1017739408.
The previous prime is 1054451507. The next prime is 1054451543. The reversal of 1054451513 is 3151544501.
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 1054451513 - 28 = 1054451257 is a prime.
It is a super-2 number, since 2×10544515132 = 2223735986535978338, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (1054451543) 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, 127148 + ... + 135186.
It is an arithmetic number, because the mean of its divisors is an integer number (136398600).
Almost surely, 21054451513 is an apocalyptic number.
It is an amenable number.
1054451513 is a deficient number, since it is larger than the sum of its proper divisors (36737287).
1054451513 is an equidigital number, since it uses as much as digits as its factorization.
1054451513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12591.
The product of its (nonzero) digits is 6000, while the sum is 29.
The square root of 1054451513 is about 32472.3191811118. The cubic root of 1054451513 is about 1017.8306814762.
The spelling of 1054451513 in words is "one billion, fifty-four million, four hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •