Base | Representation |
---|---|
bin | 10011110010100100000… |
… | …000101100111111000101 |
3 | 11211000022001010202200201 |
4 | 103302210000230333011 |
5 | 134240200044010341 |
6 | 2520431350410501 |
7 | 200153052300550 |
oct | 23624400547705 |
9 | 4730261122621 |
10 | 1359961313221 |
11 | 484835786305 |
12 | 19b6a0360a31 |
13 | 9b32282a734 |
14 | 49b72c4b697 |
15 | 25598085331 |
hex | 13ca402cfc5 |
1359961313221 has 4 divisors (see below), whose sum is σ = 1554241500832. Its totient is φ = 1165681125612.
The previous prime is 1359961313159. The next prime is 1359961313257. The reversal of 1359961313221 is 1223131699531.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1359961313221 - 27 = 1359961313093 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 (1359961313261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97140093795 + ... + 97140093808.
It is an arithmetic number, because the mean of its divisors is an integer number (388560375208).
Almost surely, 21359961313221 is an apocalyptic number.
It is an amenable number.
1359961313221 is a deficient number, since it is larger than the sum of its proper divisors (194280187611).
1359961313221 is an equidigital number, since it uses as much as digits as its factorization.
1359961313221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194280187610.
The product of its digits is 262440, while the sum is 46.
The spelling of 1359961313221 in words is "one trillion, three hundred fifty-nine billion, nine hundred sixty-one million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •