Base | Representation |
---|---|
bin | 10011000100001001111… |
… | …101010110010001000101 |
3 | 11122020200100200120112002 |
4 | 103010021331112101011 |
5 | 132431122304232323 |
6 | 2441511045435045 |
7 | 163440203061104 |
oct | 23041175262105 |
9 | 4566610616462 |
10 | 1310132102213 |
11 | 465695464590 |
12 | 191ab470ba85 |
13 | 967112881ac |
14 | 475a709803b |
15 | 2412d6c9828 |
hex | 13109f56445 |
1310132102213 has 8 divisors (see below), whose sum is σ = 1429247582496. Its totient is φ = 1191018715600.
The previous prime is 1310132102177. The next prime is 1310132102221. The reversal of 1310132102213 is 3122012310131.
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 1310132102213 - 240 = 210620474437 is a prime.
It is a super-2 number, since 2×13101321022132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310132104213) 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, 970358 + ... + 1887288.
It is an arithmetic number, because the mean of its divisors is an integer number (178655947812).
Almost surely, 21310132102213 is an apocalyptic number.
It is an amenable number.
1310132102213 is a deficient number, since it is larger than the sum of its proper divisors (119115480283).
1310132102213 is a wasteful number, since it uses less digits than its factorization.
1310132102213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1046835.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1310132102213 its reverse (3122012310131), we get a palindrome (4432144412344).
The spelling of 1310132102213 in words is "one trillion, three hundred ten billion, one hundred thirty-two million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •