Base | Representation |
---|---|
bin | 10000001100110110000… |
… | …010010111110110100001 |
3 | 10221102122000020100110112 |
4 | 100030312002113312201 |
5 | 121220021044340223 |
6 | 2211235553341105 |
7 | 143301455251535 |
oct | 20146602276641 |
9 | 3842560210415 |
10 | 1113303121313 |
11 | 39a170651a29 |
12 | 15b922b67795 |
13 | 80ca3bcb6a6 |
14 | 3bc541b9bc5 |
15 | 1de5d82b778 |
hex | 10336097da1 |
1113303121313 has 4 divisors (see below), whose sum is σ = 1143392394900. Its totient is φ = 1083213847728.
The previous prime is 1113303121289. The next prime is 1113303121331. The reversal of 1113303121313 is 3131213033111.
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 955922710369 + 157380410944 = 977713^2 + 396712^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113303121313 - 212 = 1113303117217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113303121393) 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, 15044636738 + ... + 15044636811.
It is an arithmetic number, because the mean of its divisors is an integer number (285848098725).
Almost surely, 21113303121313 is an apocalyptic number.
It is an amenable number.
1113303121313 is a deficient number, since it is larger than the sum of its proper divisors (30089273587).
1113303121313 is an equidigital number, since it uses as much as digits as its factorization.
1113303121313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30089273586.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1113303121313 its reverse (3131213033111), we get a palindrome (4244516154424).
The spelling of 1113303121313 in words is "one trillion, one hundred thirteen billion, three hundred three million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •