Base | Representation |
---|---|
bin | 10011110010111110011… |
… | …110000010111111010000 |
3 | 11211001102222102012220022 |
4 | 103302332132002333100 |
5 | 134242102213310021 |
6 | 2520543405003012 |
7 | 200200052342444 |
oct | 23627636027720 |
9 | 4731388365808 |
10 | 1360405213136 |
11 | 484a43305942 |
12 | 19b7a4b53468 |
13 | 9b39379c9c8 |
14 | 49bb5b9c824 |
15 | 255c201b1ab |
hex | 13cbe782fd0 |
1360405213136 has 10 divisors (see below), whose sum is σ = 2635785100482. Its totient is φ = 680202606560.
The previous prime is 1360405213133. The next prime is 1360405213157. The reversal of 1360405213136 is 6313125040631.
It can be written as a sum of positive squares in only one way, i.e., 1339472910736 + 20932302400 = 1157356^2 + 144680^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1360405213096 and 1360405213105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1360405213133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42512662895 + ... + 42512662926.
Almost surely, 21360405213136 is an apocalyptic number.
1360405213136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1360405213136 is a deficient number, since it is larger than the sum of its proper divisors (1275379887346).
1360405213136 is an equidigital number, since it uses as much as digits as its factorization.
1360405213136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85025325829 (or 85025325823 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 35.
The spelling of 1360405213136 in words is "one trillion, three hundred sixty billion, four hundred five million, two hundred thirteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •