Base | Representation |
---|---|
bin | 10000010110000101001… |
… | …000101001010011011001 |
3 | 10222101020010210002012001 |
4 | 100112011020221103121 |
5 | 121400323321202223 |
6 | 2220000012521001 |
7 | 144102304216003 |
oct | 20260510512331 |
9 | 3871203702161 |
10 | 1123220100313 |
11 | 3a339a512043 |
12 | 161830180161 |
13 | 81bc463b6bc |
14 | 3c5152cb373 |
15 | 1e33e28a9ad |
hex | 105852294d9 |
1123220100313 has 4 divisors (see below), whose sum is σ = 1161951827940. Its totient is φ = 1084488372688.
The previous prime is 1123220100281. The next prime is 1123220100337. The reversal of 1123220100313 is 3130010223211.
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 551399808969 + 571820291344 = 742563^2 + 756188^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123220100313 - 25 = 1123220100281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123220100383) 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, 19365863770 + ... + 19365863827.
It is an arithmetic number, because the mean of its divisors is an integer number (290487956985).
Almost surely, 21123220100313 is an apocalyptic number.
It is an amenable number.
1123220100313 is a deficient number, since it is larger than the sum of its proper divisors (38731727627).
1123220100313 is an equidigital number, since it uses as much as digits as its factorization.
1123220100313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38731727626.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1123220100313 its reverse (3130010223211), we get a palindrome (4253230323524).
The spelling of 1123220100313 in words is "one trillion, one hundred twenty-three billion, two hundred twenty million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •