Base | Representation |
---|---|
bin | 100110110001011… |
… | …1110010111110101 |
3 | 10100200002100200220 |
4 | 1031202332113311 |
5 | 10131024422010 |
6 | 333033124553 |
7 | 44145302514 |
oct | 11542762765 |
9 | 3320070626 |
10 | 1301014005 |
11 | 608430095 |
12 | 303859759 |
13 | 179701695 |
14 | c4b0667b |
15 | 79340970 |
hex | 4d8be5f5 |
1301014005 has 16 divisors (see below), whose sum is σ = 2082132864. Its totient is φ = 693704000.
The previous prime is 1301013997. The next prime is 1301014031. The reversal of 1301014005 is 5004101031.
It is not a de Polignac number, because 1301014005 - 23 = 1301013997 is a prime.
It is a super-2 number, since 2×13010140052 = 3385274882412280050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
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, 74632 + ... + 90398.
It is an arithmetic number, because the mean of its divisors is an integer number (130133304).
Almost surely, 21301014005 is an apocalyptic number.
1301014005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1301014005 is a deficient number, since it is larger than the sum of its proper divisors (781118859).
1301014005 is a wasteful number, since it uses less digits than its factorization.
1301014005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21276.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 1301014005 is about 36069.5717329718. The cubic root of 1301014005 is about 1091.6765728630.
Adding to 1301014005 its reverse (5004101031), we get a palindrome (6305115036).
The spelling of 1301014005 in words is "one billion, three hundred one million, fourteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •