Base | Representation |
---|---|
bin | 10011110011101101111… |
… | …110100100010111100101 |
3 | 11211010111112012210002210 |
4 | 103303231332210113211 |
5 | 134300220240030441 |
6 | 2521154440354033 |
7 | 200225601240450 |
oct | 23635576442745 |
9 | 4733445183083 |
10 | 1361202267621 |
11 | 485312214759 |
12 | 19b987a75919 |
13 | 9b48c960c91 |
14 | 49c4d99c497 |
15 | 2561beb0616 |
hex | 13cedfa45e5 |
1361202267621 has 8 divisors (see below), whose sum is σ = 2074212979264. Its totient is φ = 777829867200.
The previous prime is 1361202267619. The next prime is 1361202267631. The reversal of 1361202267621 is 1267622021631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1361202267621 - 21 = 1361202267619 is a prime.
It is a super-2 number, since 2×13612022676212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1361202267621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1361202267631) 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, 32409577780 + ... + 32409577821.
It is an arithmetic number, because the mean of its divisors is an integer number (259276622408).
Almost surely, 21361202267621 is an apocalyptic number.
It is an amenable number.
1361202267621 is a deficient number, since it is larger than the sum of its proper divisors (713010711643).
1361202267621 is an equidigital number, since it uses as much as digits as its factorization.
1361202267621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64819155611.
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 1361202267621 in words is "one trillion, three hundred sixty-one billion, two hundred two million, two hundred sixty-seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •