Base | Representation |
---|---|
bin | 10000010110001011001… |
… | …010100001010001100101 |
3 | 10222101111012010021100102 |
4 | 100112023022201101211 |
5 | 121401030220130023 |
6 | 2220014024553445 |
7 | 144104643060446 |
oct | 20261312412145 |
9 | 3871435107312 |
10 | 1123321255013 |
11 | 3a3441622071 |
12 | 16185a022885 |
13 | 81c0c597959 |
14 | 3c5248dd2cd |
15 | 1e3480bc628 |
hex | 1058b2a1465 |
1123321255013 has 4 divisors (see below), whose sum is σ = 1123423451148. Its totient is φ = 1123219058880.
The previous prime is 1123321254961. The next prime is 1123321255073. The reversal of 1123321255013 is 3105521233211.
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 246554950849 + 876766304164 = 496543^2 + 936358^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123321255013 - 234 = 1106141385829 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 (1123321255073) 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, 51081578 + ... + 51103563.
It is an arithmetic number, because the mean of its divisors is an integer number (280855862787).
Almost surely, 21123321255013 is an apocalyptic number.
It is an amenable number.
1123321255013 is a deficient number, since it is larger than the sum of its proper divisors (102196135).
1123321255013 is a wasteful number, since it uses less digits than its factorization.
1123321255013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102196134.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 1123321255013 its reverse (3105521233211), we get a palindrome (4228842488224).
The spelling of 1123321255013 in words is "one trillion, one hundred twenty-three billion, three hundred twenty-one million, two hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •