Base | Representation |
---|---|
bin | 10000010110110011101… |
… | …000111100111100100001 |
3 | 10222110020111220102012010 |
4 | 100112303220330330201 |
5 | 121403423040240223 |
6 | 2220205243423133 |
7 | 144130530043542 |
oct | 20266350747441 |
9 | 3873214812163 |
10 | 1124000321313 |
11 | 3a375a973691 |
12 | 161a09524aa9 |
13 | 81cba18792c |
14 | 3c58ab884c9 |
15 | 1e387a07393 |
hex | 105b3a3cf21 |
1124000321313 has 4 divisors (see below), whose sum is σ = 1498667095088. Its totient is φ = 749333547540.
The previous prime is 1124000321299. The next prime is 1124000321321. The reversal of 1124000321313 is 3131230004211.
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 not a de Polignac number, because 1124000321313 - 25 = 1124000321281 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1124000321313.
It is not an unprimeable number, because it can be changed into a prime (1124000321413) 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, 187333386883 + ... + 187333386888.
It is an arithmetic number, because the mean of its divisors is an integer number (374666773772).
Almost surely, 21124000321313 is an apocalyptic number.
It is an amenable number.
1124000321313 is a deficient number, since it is larger than the sum of its proper divisors (374666773775).
1124000321313 is an equidigital number, since it uses as much as digits as its factorization.
1124000321313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374666773774.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1124000321313 its reverse (3131230004211), we get a palindrome (4255230325524).
The spelling of 1124000321313 in words is "one trillion, one hundred twenty-four billion, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •