Base | Representation |
---|---|
bin | 11101011111000110101… |
… | …00000110010011100101 |
3 | 10120212001211201220122221 |
4 | 32233203110012103211 |
5 | 113044343014330201 |
6 | 2053232001352341 |
7 | 133124221335553 |
oct | 16574324062345 |
9 | 3525054656587 |
10 | 1013131011301 |
11 | 360737053052 |
12 | 1444276386b1 |
13 | 746cb84b406 |
14 | 37070356bd3 |
15 | 1b5494464a1 |
hex | ebe35064e5 |
1013131011301 has 4 divisors (see below), whose sum is σ = 1024514505900. Its totient is φ = 1001747516704.
The previous prime is 1013131011293. The next prime is 1013131011349. The reversal of 1013131011301 is 1031101313101.
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 599000150401 + 414130860900 = 773951^2 + 643530^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013131011301 - 23 = 1013131011293 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 (1013131011701) 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, 5691747166 + ... + 5691747343.
It is an arithmetic number, because the mean of its divisors is an integer number (256128626475).
Almost surely, 21013131011301 is an apocalyptic number.
It is an amenable number.
1013131011301 is a deficient number, since it is larger than the sum of its proper divisors (11383494599).
1013131011301 is an equidigital number, since it uses as much as digits as its factorization.
1013131011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11383494598.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1013131011301 its reverse (1031101313101), we get a palindrome (2044232324402).
The spelling of 1013131011301 in words is "one trillion, thirteen billion, one hundred thirty-one million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •