Base | Representation |
---|---|
bin | 10011001001101010110… |
… | …001000010010111111101 |
3 | 11122210221212120112110121 |
4 | 103021222301002113331 |
5 | 133030233103413003 |
6 | 2444330253134541 |
7 | 164036655621022 |
oct | 23115261022775 |
9 | 4583855515417 |
10 | 1316051232253 |
11 | 46815267a59a |
12 | 193086a8a451 |
13 | 9714567a8c4 |
14 | 479a9255549 |
15 | 2437818acbd |
hex | 1326ac425fd |
1316051232253 has 4 divisors (see below), whose sum is σ = 1316055027580. Its totient is φ = 1316047436928.
The previous prime is 1316051232241. The next prime is 1316051232271. The reversal of 1316051232253 is 3522321506131.
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 1136243006809 + 179808225444 = 1065947^2 + 424038^2 .
It is a cyclic number.
It is not a de Polignac number, because 1316051232253 - 29 = 1316051231741 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 (1316051232553) 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, 1318638 + ... + 2090671.
It is an arithmetic number, because the mean of its divisors is an integer number (329013756895).
Almost surely, 21316051232253 is an apocalyptic number.
It is an amenable number.
1316051232253 is a deficient number, since it is larger than the sum of its proper divisors (3795327).
1316051232253 is an equidigital number, since it uses as much as digits as its factorization.
1316051232253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3795326.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 1316051232253 its reverse (3522321506131), we get a palindrome (4838372738384).
The spelling of 1316051232253 in words is "one trillion, three hundred sixteen billion, fifty-one million, two hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •