Base | Representation |
---|---|
bin | 10010111011101011100… |
… | …000100101001100110101 |
3 | 11121101012002221102202202 |
4 | 102323223200211030311 |
5 | 132304003003411013 |
6 | 2433404024114245 |
7 | 162665524445432 |
oct | 22735340451465 |
9 | 4541162842682 |
10 | 1301031310133 |
11 | 461845290815 |
12 | 190194905985 |
13 | 958c0977a19 |
14 | 46d82526b89 |
15 | 23c9973d858 |
hex | 12eeb825335 |
1301031310133 has 4 divisors (see below), whose sum is σ = 1301302306668. Its totient is φ = 1300760313600.
The previous prime is 1301031310087. The next prime is 1301031310151. The reversal of 1301031310133 is 3310131301031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 525685901764 + 775345408369 = 725042^2 + 880537^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301031310133 - 212 = 1301031306037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301031310433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135491066 + ... + 135500667.
It is an arithmetic number, because the mean of its divisors is an integer number (325325576667).
Almost surely, 21301031310133 is an apocalyptic number.
It is an amenable number.
1301031310133 is a deficient number, since it is larger than the sum of its proper divisors (270996535).
1301031310133 is an equidigital number, since it uses as much as digits as its factorization.
1301031310133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270996534.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 1301031310133 its reverse (3310131301031), we get a palindrome (4611162611164).
The spelling of 1301031310133 in words is "one trillion, three hundred one billion, thirty-one million, three hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •