Base | Representation |
---|---|
bin | 10011000101111111100… |
… | …101010110000100010111 |
3 | 11122102202220000122202202 |
4 | 103011333211112010113 |
5 | 132444143003141211 |
6 | 2442434542555115 |
7 | 163540124624645 |
oct | 23057745260427 |
9 | 4572686018682 |
10 | 1312105521431 |
11 | 4665083a6661 |
12 | 192365598a9b |
13 | 96967086983 |
14 | 477131d4195 |
15 | 241e6a8b53b |
hex | 1317f956117 |
1312105521431 has 8 divisors (see below), whose sum is σ = 1323761795664. Its totient is φ = 1300450032000.
The previous prime is 1312105521407. The next prime is 1312105521439. The reversal of 1312105521431 is 1341255012131.
It is a happy number.
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 1312105521431 - 238 = 1037227614487 is a prime.
It is a super-2 number, since 2×13121055214312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1312105521394 and 1312105521403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312105521439) 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, 3464345 + ... + 3824381.
It is an arithmetic number, because the mean of its divisors is an integer number (165470224458).
Almost surely, 21312105521431 is an apocalyptic number.
1312105521431 is a deficient number, since it is larger than the sum of its proper divisors (11656274233).
1312105521431 is a wasteful number, since it uses less digits than its factorization.
1312105521431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392401.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 1312105521431 in words is "one trillion, three hundred twelve billion, one hundred five million, five hundred twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •