Base | Representation |
---|---|
bin | 100111001000111… |
… | …0101111010011001 |
3 | 10101112012120002020 |
4 | 1032101311322121 |
5 | 10142201100441 |
6 | 334152325053 |
7 | 44354603220 |
oct | 11621657231 |
9 | 3345176066 |
10 | 1313300121 |
11 | 614361901 |
12 | 3079a3789 |
13 | 17c113983 |
14 | c65c3cb7 |
15 | 7a46ae66 |
hex | 4e475e99 |
1313300121 has 32 divisors (see below), whose sum is σ = 2113013760. Its totient is φ = 708777216.
The previous prime is 1313300117. The next prime is 1313300123. The reversal of 1313300121 is 1210033131.
It is not a de Polignac number, because 1313300121 - 22 = 1313300117 is a prime.
It is a super-2 number, since 2×13133001212 = 3449514415637229282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1313300121.
It is not an unprimeable number, because it can be changed into a prime (1313300123) 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 31 ways as a sum of consecutive naturals, for example, 129580 + ... + 139346.
It is an arithmetic number, because the mean of its divisors is an integer number (66031680).
Almost surely, 21313300121 is an apocalyptic number.
It is an amenable number.
1313300121 is a deficient number, since it is larger than the sum of its proper divisors (799713639).
1313300121 is a wasteful number, since it uses less digits than its factorization.
1313300121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10133.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 1313300121 is about 36239.4829019400. The cubic root of 1313300121 is about 1095.1022251887.
Adding to 1313300121 its reverse (1210033131), we get a palindrome (2523333252).
The spelling of 1313300121 in words is "one billion, three hundred thirteen million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •