Base | Representation |
---|---|
bin | 10011000110110110000… |
… | …110111100110000000101 |
3 | 11122112010122100020110100 |
4 | 103012312012330300011 |
5 | 133003031144102133 |
6 | 2443105421514313 |
7 | 163601603255502 |
oct | 23066606746005 |
9 | 4575118306410 |
10 | 1313020300293 |
11 | 466937802549 |
12 | 19257ba12999 |
13 | 96a81756140 |
14 | 4779c8ba4a9 |
15 | 2424c036e13 |
hex | 131b61bcc05 |
1313020300293 has 96 divisors (see below), whose sum is σ = 2117632608000. Its totient is φ = 778792320000.
The previous prime is 1313020300283. The next prime is 1313020300313. The reversal of 1313020300293 is 3920030203131.
1313020300293 is a `hidden beast` number, since 1 + 31 + 302 + 0 + 300 + 29 + 3 = 666.
It is not a de Polignac number, because 1313020300293 - 25 = 1313020300261 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313020300283) 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 95 ways as a sum of consecutive naturals, for example, 241761288 + ... + 241766718.
It is an arithmetic number, because the mean of its divisors is an integer number (22058673000).
Almost surely, 21313020300293 is an apocalyptic number.
1313020300293 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1313020300293 is a deficient number, since it is larger than the sum of its proper divisors (804612307707).
1313020300293 is a wasteful number, since it uses less digits than its factorization.
1313020300293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6091 (or 6088 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
The spelling of 1313020300293 in words is "one trillion, three hundred thirteen billion, twenty million, three hundred thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •