Base | Representation |
---|---|
bin | 10011110100001001111… |
… | …011011101000000101101 |
3 | 11211011201012121200100220 |
4 | 103310021323131000231 |
5 | 134302200312304401 |
6 | 2521313151441553 |
7 | 200243324224443 |
oct | 23641173350055 |
9 | 4734635550326 |
10 | 1361671213101 |
11 | 4855329a0401 |
12 | 19ba98b262b9 |
13 | 9b535b62104 |
14 | 49c95d8cb93 |
15 | 25648242336 |
hex | 13d09edd02d |
1361671213101 has 8 divisors (see below), whose sum is σ = 1922359359744. Its totient is φ = 854381937600.
The previous prime is 1361671213081. The next prime is 1361671213121. The reversal of 1361671213101 is 1013121761631.
It is an interprime number because it is at equal distance from previous prime (1361671213081) and next prime (1361671213121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1361671213101 - 222 = 1361667018797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1361671213121) 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, 13349717725 + ... + 13349717826.
It is an arithmetic number, because the mean of its divisors is an integer number (240294919968).
Almost surely, 21361671213101 is an apocalyptic number.
It is an amenable number.
1361671213101 is a deficient number, since it is larger than the sum of its proper divisors (560688146643).
1361671213101 is a wasteful number, since it uses less digits than its factorization.
1361671213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26699435571.
The product of its (nonzero) digits is 4536, while the sum is 33.
Adding to 1361671213101 its reverse (1013121761631), we get a palindrome (2374792974732).
The spelling of 1361671213101 in words is "one trillion, three hundred sixty-one billion, six hundred seventy-one million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •