Base | Representation |
---|---|
bin | 10011110110000111010… |
… | …001110100100010100001 |
3 | 11211101010202210221100100 |
4 | 103312013101310202201 |
5 | 134321002200304031 |
6 | 2522301554413013 |
7 | 200346411451206 |
oct | 23660721644241 |
9 | 4741122727310 |
10 | 1363774228641 |
11 | 486411aa9080 |
12 | 1a0385291169 |
13 | 9b7ac7676c6 |
14 | 4a0153c1cad |
15 | 2571cba2de6 |
hex | 13d874748a1 |
1363774228641 has 24 divisors (see below), whose sum is σ = 2149053510240. Its totient is φ = 826500628800.
The previous prime is 1363774228637. The next prime is 1363774228651. The reversal of 1363774228641 is 1468224773631.
1363774228641 is a `hidden beast` number, since 1 + 3 + 6 + 377 + 4 + 228 + 6 + 41 = 666.
It is not a de Polignac number, because 1363774228641 - 22 = 1363774228637 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1363774228651) 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 23 ways as a sum of consecutive naturals, for example, 2758426 + ... + 3215036.
It is an arithmetic number, because the mean of its divisors is an integer number (89543896260).
Almost surely, 21363774228641 is an apocalyptic number.
1363774228641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1363774228641 is a deficient number, since it is larger than the sum of its proper divisors (785279281599).
1363774228641 is a wasteful number, since it uses less digits than its factorization.
1363774228641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486797 (or 486794 counting only the distinct ones).
The product of its digits is 8128512, while the sum is 54.
The spelling of 1363774228641 in words is "one trillion, three hundred sixty-three billion, seven hundred seventy-four million, two hundred twenty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •