Base | Representation |
---|---|
bin | 10011000111000111011… |
… | …011111000101000100011 |
3 | 11122112212220100101000202 |
4 | 103013013123320220203 |
5 | 133004130104013443 |
6 | 2443154324335415 |
7 | 163612033215002 |
oct | 23070733705043 |
9 | 4575786311022 |
10 | 1313311001123 |
11 | 466a76905370 |
12 | 19264124456b |
13 | 96ac9a49374 |
14 | 477c934cc39 |
15 | 2426780a7b8 |
hex | 131c76f8a23 |
1313311001123 has 8 divisors (see below), whose sum is σ = 1456189844016. Its totient is φ = 1174346647200.
The previous prime is 1313311001089. The next prime is 1313311001131. The reversal of 1313311001123 is 3211001133131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1313311001123 - 26 = 1313311001059 is a prime.
It is a super-2 number, since 2×13133110011232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1313311001095 and 1313311001104.
It is not an unprimeable number, because it can be changed into a prime (1313311000123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 978621536 + ... + 978622877.
It is an arithmetic number, because the mean of its divisors is an integer number (182023730502).
Almost surely, 21313311001123 is an apocalyptic number.
1313311001123 is a deficient number, since it is larger than the sum of its proper divisors (142878842893).
1313311001123 is a wasteful number, since it uses less digits than its factorization.
1313311001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1957244485.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1313311001123 its reverse (3211001133131), we get a palindrome (4524312134254).
The spelling of 1313311001123 in words is "one trillion, three hundred thirteen billion, three hundred eleven million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •