Base | Representation |
---|---|
bin | 100111101010101… |
… | …1101010011010001 |
3 | 10102202120002012010 |
4 | 1033111131103101 |
5 | 10211220300410 |
6 | 340024253133 |
7 | 44661345444 |
oct | 11725352321 |
9 | 3382502163 |
10 | 1331025105 |
11 | 623368953 |
12 | 3119111a9 |
13 | 1829ab727 |
14 | c8ab965b |
15 | 7bcbcc20 |
hex | 4f55d4d1 |
1331025105 has 16 divisors (see below), whose sum is σ = 2130194304. Its totient is φ = 709695360.
The previous prime is 1331025103. The next prime is 1331025131. The reversal of 1331025105 is 5015201331.
It is not a de Polignac number, because 1331025105 - 21 = 1331025103 is a prime.
It is a super-2 number, since 2×13310251052 = 3543255660280522050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1331025103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63957 + ... + 82173.
It is an arithmetic number, because the mean of its divisors is an integer number (133137144).
Almost surely, 21331025105 is an apocalyptic number.
1331025105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1331025105 is a deficient number, since it is larger than the sum of its proper divisors (799169199).
1331025105 is a wasteful number, since it uses less digits than its factorization.
1331025105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23096.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 1331025105 is about 36483.2167578463. The cubic root of 1331025105 is about 1100.0069159345.
Adding to 1331025105 its reverse (5015201331), we get a palindrome (6346226436).
The spelling of 1331025105 in words is "one billion, three hundred thirty-one million, twenty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •