Base | Representation |
---|---|
bin | 10000010110001010011… |
… | …111100111111111001001 |
3 | 10222101110101221222112001 |
4 | 100112022133213333021 |
5 | 121401014330312223 |
6 | 2220012543551001 |
7 | 144104445355201 |
oct | 20261237477711 |
9 | 3871411858461 |
10 | 1123310010313 |
11 | 3a3436241827 |
12 | 1618562bb461 |
13 | 81c0a15b69a |
14 | 3c523213401 |
15 | 1e3470ea9ad |
hex | 1058a7e7fc9 |
1123310010313 has 4 divisors (see below), whose sum is σ = 1123330246528. Its totient is φ = 1123289774100.
The previous prime is 1123310010257. The next prime is 1123310010439. The reversal of 1123310010313 is 3130100133211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123310010313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123310010913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10034613 + ... + 10145938.
It is an arithmetic number, because the mean of its divisors is an integer number (280832561632).
Almost surely, 21123310010313 is an apocalyptic number.
It is an amenable number.
1123310010313 is a deficient number, since it is larger than the sum of its proper divisors (20236215).
1123310010313 is an equidigital number, since it uses as much as digits as its factorization.
1123310010313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20236214.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1123310010313 its reverse (3130100133211), we get a palindrome (4253410143524).
The spelling of 1123310010313 in words is "one trillion, one hundred twenty-three billion, three hundred ten million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •