Base | Representation |
---|---|
bin | 10101101100001110010… |
… | …001101011101111010101 |
3 | 12021111111000000120121000 |
4 | 111230032101223233111 |
5 | 143410213322341331 |
6 | 3100434040413513 |
7 | 212456200610244 |
oct | 25541621535725 |
9 | 5244430016530 |
10 | 1490593168341 |
11 | 52517aa90552 |
12 | 200a78777299 |
13 | aa7405a2324 |
14 | 522061d295b |
15 | 28b9160a0e6 |
hex | 15b0e46bbd5 |
1490593168341 has 8 divisors (see below), whose sum is σ = 2208286175360. Its totient is φ = 993728778876.
The previous prime is 1490593168313. The next prime is 1490593168349. The reversal of 1490593168341 is 1438613950941.
1490593168341 is a `hidden beast` number, since 1 + 4 + 9 + 0 + 593 + 1 + 6 + 8 + 3 + 41 = 666.
It is not a de Polignac number, because 1490593168341 - 215 = 1490593135573 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1490593168349) 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 in 7 ways as a sum of consecutive naturals, for example, 27603577165 + ... + 27603577218.
It is an arithmetic number, because the mean of its divisors is an integer number (276035771920).
Almost surely, 21490593168341 is an apocalyptic number.
It is an amenable number.
1490593168341 is a deficient number, since it is larger than the sum of its proper divisors (717693007019).
1490593168341 is an equidigital number, since it uses as much as digits as its factorization.
1490593168341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55207154392 (or 55207154386 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 54.
The spelling of 1490593168341 in words is "one trillion, four hundred ninety billion, five hundred ninety-three million, one hundred sixty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •